A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
From MaRDI portal
Publication:2995265
DOI10.1007/978-1-4419-0437-9_5zbMath1227.90031OpenAlexW2172478086WikidataQ58048457 ScholiaQ58048457MaRDI QIDQ2995265
C. Yalçın Kaya, Regina Sandra Burachik
Publication date: 20 April 2011
Published in: Variational Analysis and Generalized Differentiation in Optimization and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4419-0437-9_5
Related Items
A New Sequential Optimality Condition for Constrained Nonsmooth Optimization ⋮ An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians ⋮ A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm ⋮ An augmented penalty function method with penalty parameter updates for nonconvex optimization ⋮ Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality ⋮ The exact penalty map for nonsmooth and nonconvex optimization ⋮ Primal convergence from dual subgradient methods for convex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- Test examples for nonlinear programming codes
- On the choice of step size in subgradient optimization
- Nonlinear rescaling and proximal-like methods in convex optimization
- Lagrange-type functions in constrained optimization
- Computational method for time-optimal switching control
- Nonlinear rescaling vs. smoothing technique in convex optimization
- Optimization and control with applications.
- On the absence of duality gap for Lagrange-type functions
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- On global maximum of a convex terminal functional in optimal control problems
- A variable target value method for nondifferentiable optimization
- An inexact modified subgradient algorithm for nonconvex optimization
- A primal dual modified subgradient algorithm with sharp Lagrangian
- A nonlinear Lagrangian based on Fischer-Burmeister NCP function
- An update rule and a convergence result for a penalty function method
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- Algorithms for some minimax problems
- A Nonlinear Lagrangian Approach to Constrained Optimization Problems
- On primal convergence for augmented Lagrangian duality
- Variational Analysis
- Strictly Increasing Positively Homogeneous Functions with Application to Exact Penalization
- On Convergence Properties of a Subgradient Method
- Decreasing Functions with Applications to Penalization
- Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
- The conjugate gradient method in extremal problems
- Minimization of unsmooth functionals
- Abstract convexity and global optimization
