The DOI matches its Crossref record.
Entropic Proximal Mappings with Applications to Nonlinear Programming
Abstract
We introduce a family of new transforms based on imitating the proximal mapping of Moreau and the associated Moreau-Yosida proximal approximation of a function. The transforms are constructed in terms of the φ-divergence functional (a generalization of the relative entropy) and of Bregman's measure of distance. An analogue of Moreau's theorem associated with these entropy-like distances is proved. We show that the resulting Entropic Proximal Maps share properties similar to the proximal mapping and provide a fairly general framework for constructing approximation and smoothing schemes for optimization problems. Applications of the results to the construction of generalized augmented Lagrangians for nonlinear programs and the minimax problem are presented.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Mirror descent and nonlinear projected subgradient methods for convex optimization
Beck, A., & Teboulle, M. (2003) · Operations Research Letters · doi:10.1016/s0167-6377(02)00231-6 · Cited by 1,060
Self-citationAn introduction to continuous optimization for imaging
Chambolle, A., & Pock, T. (2016) · Acta Numerica · doi:10.1017/s096249291600009x · Cited by 545
Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
Chen, G., & Teboulle, M. (1993) · SIAM Journal on Optimization · doi:10.1137/0803026 · Cited by 428
Self-citationModern regularization methods for inverse problems
Benning, M., & Burger, M. (2018) · Acta Numerica · doi:10.1017/s0962492918000016 · Cited by 412
On the ergodic convergence rates of a first-order primal–dual algorithm
Chambolle, A., & Pock, T. (2016) · Mathematical Programming · doi:10.1007/s10107-015-0957-3 · Cited by 411
A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
Bauschke, H. H., Bolte, J., & Teboulle, M. (2017) · Mathematics of Operations Research · doi:10.1287/moor.2016.0817 · Cited by 325
Self-citationNonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
Eckstein, J. (1993) · Mathematics of Operations Research · doi:10.1287/moor.18.1.202 · Cited by 324
Interior Gradient and Proximal Methods for Convex and Conic Optimization
Auslender, A., & Teboulle, M. (2006) · SIAM Journal on Optimization · doi:10.1137/s1052623403427823 · Cited by 269
Self-citationProximal minimization algorithm withD-functions
Censor, Y., & Zenios, S. A. (1992) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940051 · Cited by 268
Smoothing and First Order Methods: A Unified Framework
Beck, A., & Teboulle, M. (2012) · SIAM Journal on Optimization · doi:10.1137/100818327 · Cited by 267
Self-citation
Metadata
- Authors
- Teboulle, M.
- Venue
- Mathematics of Operations Research
- Published
- 1992-08
- Volume
- 17
- Issue
- 3
- Pages
- 670-690
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2009274429
- Cited by
- 240
- References
- 0
- FWCI
- 7.91
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.