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_5zbMATH Open1227.90031OpenAlexW2172478086WikidataQ58048457 ScholiaQ58048457MaRDI QIDQ2995265FDOQ2995265
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
Cites Work
- Variational Analysis
- Title not available (Why is that?)
- The conjugate gradient method in extremal problems
- Nonlinear rescaling vs. smoothing technique in convex optimization
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Test examples for nonlinear programming codes
- On global maximum of a convex terminal functional in optimal control problems
- Abstract convexity and global optimization
- Computational method for time-optimal switching control
- Minimization of unsmooth functionals
- Lagrange-type functions in constrained optimization
- On the choice of step size in subgradient optimization
- A nonlinear Lagrangian approach to constrained optimization problems
- Decreasing Functions with Applications to Penalization
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- A variable target value method for nondifferentiable optimization
- Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
- A primal dual modified subgradient algorithm with sharp Lagrangian
- Title not available (Why is that?)
- Nonlinear rescaling and proximal-like methods in convex optimization
- On primal convergence for augmented Lagrangian duality
- An inexact modified subgradient algorithm for nonconvex optimization
- An update rule and a convergence result for a penalty function method
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- On the absence of duality gap for Lagrange-type functions
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- On Convergence Properties of a Subgradient Method
- Algorithms for some minimax problems
- Title not available (Why is that?)
- Optimization and control with applications.
- A nonlinear Lagrangian based on Fischer-Burmeister NCP function
- Strictly Increasing Positively Homogeneous Functions with Application to Exact Penalization
Cited In (7)
- Primal convergence from dual subgradient methods for convex optimization
- 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
- An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians
- A New Sequential Optimality Condition for Constrained Nonsmooth Optimization
- The exact penalty map for nonsmooth and nonconvex optimization
- A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm
Recommendations
- A new augmented Lagrangian approach to duality and exact penalization 👍 👎
- An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians 👍 👎
- Title not available (Why is that?) 👍 👎
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems 👍 👎
- Title not available (Why is that?) 👍 👎
- 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 👍 👎
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)
