An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians
From MaRDI portal
Publication:1955564
DOI10.1007/s10957-012-0158-7zbMath1266.90194OpenAlexW2103132163WikidataQ58048424 ScholiaQ58048424MaRDI QIDQ1955564
Jefferson G. Melo, Alfredo Noel Iusem, Regina Sandra Burachik
Publication date: 14 June 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0158-7
nonsmooth optimizationBanach spacesnonconvex optimizationaugmented Lagrangianduality schemeinexact modified subgradient algorithm
Related Items
A primal–dual penalty method via rounded weighted-ℓ1 Lagrangian duality ⋮ A regularization method based on level sets and augmented Lagrangian for parameter identification problems with piecewise constant solutions ⋮ Incremental subgradient algorithms with dynamic step sizes for separable convex optimizations ⋮ A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm ⋮ Subgradient algorithms on Riemannian manifolds of lower bounded curvatures ⋮ The exact penalty map for nonsmooth and nonconvex optimization ⋮ Revisiting augmented Lagrangian duals
Cites Work
- Unnamed Item
- Duality and exact penalization for general augmented Lagrangians
- Duality and penalization in optimization via an augmented Lagrangian function with applications
- Subgradient methods for saddle-point problems
- Test examples for nonlinear programming codes
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Lagrange-type functions in constrained non-convex optimization.
- Augmented Lagrangian methods for nonsmooth, convex optimization in Hilbert spaces
- On augmented Lagrangians for optimization problems with a single constraint
- On the absence of duality gap for Lagrange-type functions
- Further study on augmented Lagrangian duality theory
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- An inexact modified subgradient algorithm for nonconvex optimization
- A primal dual modified subgradient algorithm with sharp Lagrangian
- Set-valued mappings and enlargement of monotone operators.
- An update rule and a convergence result for a penalty function method
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
- Abstract Convexity and Augmented Lagrangians
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Variational Analysis
- Mesh-Independence for an Augmented Lagrangian-SQP Method in Hilbert Spaces
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
