A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
From MaRDI portal
Publication:2995265
Recommendations
- A new augmented Lagrangian approach to duality and exact penalization
- An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians
- scientific article; zbMATH DE number 2221949
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- scientific article; zbMATH DE number 3910142
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- A new family of penalties for augmented Lagrangian methods
- Duality and penalization in optimization via an augmented Lagrangian function with applications
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- Duality and exact penalization for general augmented Lagrangians
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 3345343 (Why is no real title available?)
- A nonlinear Lagrangian approach to constrained optimization problems
- A nonlinear Lagrangian based on Fischer-Burmeister NCP function
- A primal dual modified subgradient algorithm with sharp Lagrangian
- A variable target value method for nondifferentiable optimization
- Abstract convexity and global optimization
- Algorithms for some minimax problems
- An inexact modified subgradient algorithm for nonconvex optimization
- An update rule and a convergence result for a penalty function method
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- Computational method for time-optimal switching control
- Convergence analysis of deflected conditional approximate subgradient methods
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- Decreasing Functions with Applications to Penalization
- Lagrange-type functions in constrained optimization
- Minimization of unsmooth functionals
- Nonlinear rescaling and proximal-like methods in convex optimization
- Nonlinear rescaling vs. smoothing technique in convex optimization
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- On Convergence Properties of a Subgradient Method
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- On global maximum of a convex terminal functional in optimal control problems
- On primal convergence for augmented Lagrangian duality
- On the absence of duality gap for Lagrange-type functions
- On the choice of step size in subgradient optimization
- Optimization and control with applications.
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- Strictly Increasing Positively Homogeneous Functions with Application to Exact Penalization
- Test examples for nonlinear programming codes
- The conjugate gradient method in extremal problems
- The nonlinear and augmented Lagrangians for nonconvex optimization problems with a single constraint
- Variational Analysis
Cited in
(8)- An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians
- Primal convergence from dual subgradient methods for convex optimization
- The exact penalty map for nonsmooth and nonconvex optimization
- An augmented penalty function method with penalty parameter updates for nonconvex optimization
- A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm
- A new sequential optimality condition for constrained nonsmooth optimization
- A geometric framework for nonconvex optimization duality using augmented Lagrangian functions
- Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality
This page was built for publication: A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2995265)
