A new family of penalties for augmented Lagrangian methods
From MaRDI portal
Publication:3588894
DOI10.1002/nla.596zbMath1212.65228OpenAlexW2171809503MaRDI QIDQ3588894
Luiz Carlos Matioli, Clóvis C. Gonzaga
Publication date: 10 September 2010
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.596
algorithmglobal convergencepenalizationlogarithmic barrier functionaugmented Lagrangianproximal pointBregman distanceDikin ellipsoids
Related Items
The Legendre Transformation in Modern Optimization, Augmented Lagrangian applied to convex quadratic problems, A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem, Solving large-scale reactive optimal power flow problems by a primal-dual \(\mathrm{M}^2\mathrm{BF}\) approach, Lagrangian transformation and interior ellipsoid methods in convex optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence of the exponential multiplier method for convex programming
- Modified barrier functions (theory and methods)
- Proximal minimization algorithm with \(D\)-functions
- On the convergence rate of entropic proximal optimization methods
- Nonlinear rescaling and proximal-like methods in convex optimization
- BOX-QUACAN and the implementation of augmented Lagrangian algorithms for minimization with inequality constraints
- Rescaling and Stepsize Selection in Proximal Methods Using Separable Generalized Distances
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Numerical Optimization
- Penalty/Barrier Multiplier Methods for Convex Programming Problems
- CUTE
- Variational Analysis
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Entropy-Like Proximal Methods in Convex Programming
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- Benchmarking optimization software with performance profiles.
