Entropic Proximal Mappings with Applications to Nonlinear Programming

Marc Teboulle

Type: Article

Publication Date: 1992-08-01

Citations: 242

DOI: https://doi.org/10.1287/moor.17.3.670

View Publication

Locations

Mathematics of Operations Research - View

Similar Works

Action	Title	Year	Authors
+	Entropic Proximal Mappings with Applications to Nonlinear Programming	1992	TeboulleMarc
+	Entropy-Like Proximal Methods in Convex Programming	1994	Alfredo N. Iusem B. F. Svaiter Marc Teboulle
+	Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm	2014	Abdelouahed Hamdi Abdellah Bnouhachem
+	Nonlinear rescaling and proximal-like methods in convex optimization	1997	Roman A. Polyak Marc Teboulle
+	Proximal Algorithms	2013	Neal Parikh Stephen Boyd
+	Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming	1993	EcksteinJonathan
+	Addressing the greediness phenomenon in Nonlinear Programming by means of Proximal Augmented Lagrangians	2009	Emerson Vitor Castelani André Luís Machado Martinez J. M. Martı́nez B. F. Svaiter
+	Proximal Newton-type methods for convex optimization	2012	Jason D. Lee Yuekai Sun Michael A. Saunders
+	Proximal Bundle Algorithms for Nonlinearly Constrained Convex Minimax Fractional Programs	2018	Smail Addoune Karima Boufi Ahmed Roubi
+	Derivative-Free Optimization Via Proximal Point Methods	2013	Warren Hare Yves Lucet
+	Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming	1995	Alfredo N. Iusem Marc Teboulle
+	On proximal gradient mapping and its minimization in norm via potential function-based acceleration	2022	C. Beier Hui Zhang
+	Penalty-proximal methods in convex programming	1987	A. Auslender Jean-Pierre Crouzeix P. Fedit
+	Proximal Minimization Methods with Generalized Bregman Functions	1995	Krzysztof C. Kiwiel
+	Proximal-Like Methods for Convex Minimization Problems	2005	Christian Kanzow
+	Proximal Minimization Algorithm with D-Functions 1'2	1992	Yair Censor Stavros A. Zenios
+	Convergence of Proximal-Like Algorithms	1997	Marc Teboulle
+ PDF Chat	Convex risk minimization via proximal splitting methods	2014	Radu Ioan Boţ Christopher Hendrich
+	An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms	2024	Jiefei He Huiling Zhang Zi Xu
+	Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming	1993	Jonathan Eckstein

Works That Cite This (207)

Action	Title	Year	Authors
+	Uma abordagem primal-dual de reescalamento não-linear integrado para problemas de programação matemática discreta-mista com restrições de equilíbrio e suas aplicações ao problema de fluxo de potência ótimo reativo	2017	Ricardo Bento Nogueira Pinheiro
+	On the proximal minimization algorithm with D-Functions	1992	Yair Censor Stavros A. Zenios
+	Legendre functions and the method of random Bregman projections	1997	Heinz H. Bauschke Jonathan M. Borwein
+	Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Non-Convex Optimization	2019	Mahesh Chandra Mukkamala Peter Ochs Thomas Pock Shoham Sabach
+	Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints	2024	Brendan Keith Thomas M. Surowiec
+	Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems	2000	A. Auslender Marc Teboulle
+ PDF Chat	A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima	2021	Masoud Ahookhosh Andreas Themelis Panagiotis Patrinos
+	Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization	2004	Alfred Auslender Marc Teboulle
+	Sinkhorn Divergences for Unbalanced Optimal Transport.	2019	Thibault Séjourné Jean Feydy François-Xavier Vialard Alain Trouvé Gabriel Peyré
+	Stochastic model-based minimization under high-order growth	2018	Damek Davis Dmitriy Drusvyatskiy Kellie J. MacPhee

Works Cited by This (13)

Action	Title	Year	Authors
+	Variational Convergence for Functions and Operators	1984	Hédy Attouch
+	A smoothing technique for nondifferentiable optimization problems	2006	Aharon Ben‐Tal Marc Teboulle
+ PDF Chat	Proximité et dualité dans un espace hilbertien	1965	Jean Jacques Moreau
+ PDF Chat	Unconstrained Lagrangians in Nonlinear Programming	1975	O. L. Mangasarian
+	An iterative row-action method for interval convex programming	1981	Yair Censor Arnold Lent
+	Proximal minimization algorithm withD-functions	1992	Yair Censor Stavros A. Zenios
+	A relaxed version of Bregman's method for convex programming	1986	A.R. De Pierro A. N. Iusem
+	The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming	1967	L.M. Bregman
+	Monotone Operators and the Proximal Point Algorithm	1976	R. T. Rockafellar
+ PDF Chat	Multiplicative iterative algorithms for convex programming	1990	P. P. B. Eggermont