Revisiting augmented Lagrangian duals
From MaRDI portal
Publication:2097636
DOI10.1007/s10107-021-01703-5zbMath1505.65224OpenAlexW3197711873MaRDI QIDQ2097636
M. Cordova, Welington de Oliveira, Claudia A. Sagastizábal
Publication date: 14 November 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-021-01703-5
Large-scale problems in mathematical programming (90C06) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Exact augmented Lagrangian duality for mixed integer linear programming
- Divide to conquer: decomposition methods for energy optimization
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians
- An inertial algorithm for DC programming
- On the augmented Lagrangian dual for integer programming
- Large-scale unit commitment under uncertainty
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- Level bundle methods for oracles with on-demand accuracy
- On primal convergence for augmented Lagrangian duality
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- Variational Analysis
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
- A sharp augmented Lagrangian-based method in constrained non-convex optimization
- Generalized Bundle Methods
- Abstract convexity for nonconvex optimization duality
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming
- Convex analysis and global optimization
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- A proximal bundle method based on approximate subgradients
