On the convergence rate of entropic proximal optimization methods
From MaRDI portal
Publication:1328480
zbMath0803.90101MaRDI QIDQ1328480
Alfredo Noel Iusem, Marc Teboulle
Publication date: 26 July 1994
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
convex optimizationconvergence rateproximal point algorithmentropic proximal methodsrelaxation strategy
Related Items (5)
Exponential augmented Lagrangian methods for equilibrium problems ⋮ A proximal method with logarithmic barrier for nonlinear complementarity problems ⋮ Strict convex regularizations, proximal points and augmented lagrangians ⋮ Some properties of generalized proximal point methods for quadratic and linear programming ⋮ A new family of penalties for augmented Lagrangian methods
This page was built for publication: On the convergence rate of entropic proximal optimization methods
