default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuis M. Briceño-Arias
Person information
- affiliation: Universidad Técnica Federico Santa María, Chile
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Luis M. Briceño-Arias
, Cristóbal Vivar-Vargas:
Enhanced Computation of the Proximity Operator for Perspective Functions. J. Optim. Theory Appl. 200(3): 1078-1099 (2024)- [j21]Luis M. Briceño-Arias, Patrick L. Combettes:
A Perturbation Framework for Convex Minimization and Monotone Inclusion Problems with Nonlinear Compositions. Math. Oper. Res. 49(3): 1890-1914 (2024) - [j20]Luis M. Briceño-Arias, Patrick L. Combettes, Francisco J. Silva:
Proximity Operators of Perspective Functions with Nonlinear Scaling. SIAM J. Optim. 34(4): 3212-3234 (2024) - [j19]Luis M. Briceño-Arias, Nelly Pustelnik:
Infimal post-composition approach for composite convex optimization applied to image restoration. Signal Process. 223: 109549 (2024) - 2023
- [j18]Luis M. Briceño-Arias, Fernando Roldán:
Primal-dual splittings as fixed point iterations in the range of linear operators. J. Glob. Optim. 85(4): 847-866 (2023) - [j17]Luis M. Briceño-Arias, Fernando Roldán:
Resolvent of the parallel composition and the proximity operator of the infimal postcomposition. Optim. Lett. 17(2): 399-412 (2023) - [j16]Luis M. Briceño-Arias, Nelly Pustelnik:
Theoretical and numerical comparison of first order algorithms for cocoercive equations and smooth convex optimization. Signal Process. 206: 108900 (2023) - 2022
- [j15]Luis M. Briceño-Arias, Julio Deride, Cristian Vega:
Random Activations in Primal-Dual Splittings for Monotone Inclusions with a Priori Information. J. Optim. Theory Appl. 192(1): 56-81 (2022) - [j14]Luis M. Briceño-Arias, Fernando Roldán:
Four-Operator Splitting via a Forward-Backward-Half-Forward Algorithm with Line Search. J. Optim. Theory Appl. 195(1): 205-225 (2022) - [j13]Luis M. Briceño-Arias, Nelly Pustelnik:
Convergence Rate Comparison of Proximal Algorithms for Non-Smooth Convex Optimization With an Application to Texture Segmentation. IEEE Signal Process. Lett. 29: 1337-1341 (2022) - 2021
- [j12]Luis M. Briceño-Arias, Fernando Roldán:
Split-Douglas-Rachford Algorithm for Composite Monotone Inclusions and Split-ADMM. SIAM J. Optim. 31(4): 2987-3013 (2021)
2010 – 2019
- 2019
- [j11]Daniel Navia, Antonio Puen, Paulina Quintanilla, Luis M. Briceño-Arias, Luis Bergh:
On dealing with measured disturbances in the modifier adaptation method for real-time optimization. Comput. Chem. Eng. 128: 141-163 (2019) - [j10]Luis M. Briceño-Arias, Giovanni Chierchia, Emilie Chouzenoux, Jean-Christophe Pesquet:
A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression. Comput. Optim. Appl. 72(3): 707-726 (2019) - [j9]Luis M. Briceño-Arias, Sergio López Rivera:
A Projected Primal-Dual Method for Solving Constrained Monotone Inclusions. J. Optim. Theory Appl. 180(3): 907-924 (2019) - 2018
- [j8]Luis M. Briceño-Arias, Dante Kalise, Francisco J. Silva:
Proximal Methods for Stationary Mean Field Games with Local Couplings. SIAM J. Control. Optim. 56(2): 801-836 (2018) - [j7]Luis M. Briceño-Arias, Damek Davis:
Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions. SIAM J. Optim. 28(4): 2839-2871 (2018) - 2017
- [j6]Luis M. Briceño-Arias, José R. Correa, Andrés Perlroth:
Optimal Continuous Pricing with Strategic Consumers. Manag. Sci. 63(8): 2741-2755 (2017) - [i1]Luis M. Briceño-Arias, Giovanni Chierchia, Emilie Chouzenoux, Jean-Christophe Pesquet:
A Random Block-Coordinate Douglas-Rachford Splitting Method with Low Computational Complexity for Binary Logistic Regression. CoRR abs/1712.09131 (2017) - 2016
- [j5]Hédy Attouch, Luis M. Briceño-Arias, Patrick L. Combettes:
A strongly convergent primal-dual method for nonoverlapping domain decomposition. Numerische Mathematik 133(3): 443-470 (2016) - 2015
- [j4]Luis M. Briceño-Arias:
Forward-Partial Inverse-Forward Splitting for Solving Monotone Inclusions. J. Optim. Theory Appl. 166(2): 391-413 (2015) - 2011
- [j3]Luis M. Briceño-Arias, Patrick L. Combettes, Jean-Christophe Pesquet, Nelly Pustelnik:
Proximal Algorithms for Multicomponent Image Recovery Problems. J. Math. Imaging Vis. 41(1-2): 3-22 (2011) - [j2]Luis M. Briceño-Arias, Patrick L. Combettes:
A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality. SIAM J. Optim. 21(4): 1230-1250 (2011) - 2010
- [j1]Hédy Attouch, Luis M. Briceño-Arias, Patrick L. Combettes:
A Parallel Splitting Method for Coupled Monotone Inclusions. SIAM J. Control. Optim. 48(5): 3246-3270 (2010) - [c1]Luis M. Briceño-Arias, Patrick L. Combettes, Jean-Christophe Pesquet, Nelly Pustelnik:
Proximal method for geometry and texture image decomposition. ICIP 2010: 2721-2724
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
