A primal–dual penalty method via rounded weighted-ℓ1 Lagrangian duality
From MaRDI portal
Publication:5054741
DOI10.1080/02331934.2021.1934680OpenAlexW3169040406MaRDI QIDQ5054741
No author found.
Publication date: 29 November 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2021.1934680
primal-dual methodskissing number problemMarkov-Dubins problempenalty function methods\(\ell_1\)-penalty function
Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items (2)
Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates ⋮ DC semidefinite programming and cone constrained DC optimization. I: Theory
Uses Software
Cites Work
- Stochastic filter methods for generally constrained global optimization
- Asymptotic strong duality
- Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality
- Duality and exact penalization for general augmented Lagrangians
- An augmented penalty function method with penalty parameter updates for nonconvex optimization
- Filter-based DIRECT method for constrained global optimization
- Smoothing of the lower-order exact penalty function for inequality constrained optimization
- Filter-based stochastic algorithm for global optimization
- Smoothing approximation to the lower order exact penalty function for inequality constrained optimization
- Test examples for nonlinear programming codes
- An interior-point algorithm for nonconvex nonlinear programming
- Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
- Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
- Markov-Dubins path via optimal control theory
- A unified approach to the global exactness of penalty and augmented Lagrangian functions. I: Parametric exactness
- A unified approach to the global exactness of penalty and augmented Lagrangian functions. II: Extended exactness
- On augmented Lagrangians for optimization problems with a single constraint
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians
- An inexact modified subgradient algorithm for nonconvex optimization
- A primal dual modified subgradient algorithm with sharp Lagrangian
- Markov-Dubins interpolating curves
- Unified nonlinear Lagrangian approach to duality and optimal paths
- An update rule and a convergence result for a penalty function method
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- Approximate augmented Lagrangian functions and nonlinear semidefinite programs
- Abstract Convexity and Augmented Lagrangians
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Variational Analysis
- A unifying theory of exactness of linear penalty functions II: parametric penalty functions
- On Smoothingl1Exact Penalty Function for Constrained Optimization Problems
- An exact lower order penalty function and its smoothing in nonlinear programming
- Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions
- A New Sequential Optimality Condition for Constrained Nonsmooth Optimization
- Nonlinear Augmented Lagrangian and Duality Theory
- The exact penalty map for nonsmooth and nonconvex optimization
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Practical Augmented Lagrangian Methods for Constrained Optimization
- Robust Estimation of a Location Parameter
This page was built for publication: A primal–dual penalty method via rounded weighted-ℓ1 Lagrangian duality
