Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates
From MaRDI portal
Publication:2128773
DOI10.1007/S11590-021-01777-2zbMATH Open1491.90158arXiv2102.13632OpenAlexW3180934676MaRDI QIDQ2128773FDOQ2128773
Authors: Maxim Dolgopolik
Publication date: 22 April 2022
Published in: Optimization Letters (Search for Journal in Brave)
Abstract: We present a general theory of exact penalty functions with vectorial (multidimensional) penalty parameter for optimization problems in infinite dimensional spaces. In comparison with the scalar case, the use of vectorial penalty parameters provides much more flexibility, allows one to adaptively and independently take into account the violation of each constraint during an optimization process, and often leads to a better overall performance of an optimization method using an exact penalty function. We obtain sufficient conditions for the local and global exactness of penalty functions with vectorial penalty parameters and study convergence of global exact penalty methods with several different penalty updating strategies. In particular, we present a new algorithmic approach to an analysis of the global exactness of penalty functions, which contains a novel characterisation of the global exactness property in terms of behaviour of sequences generated by certain optimization methods.
Full work available at URL: https://arxiv.org/abs/2102.13632
Recommendations
Cites Work
- Variations and extension of the convex-concave procedure
- Title not available (Why is that?)
- Trust Region Methods
- Exact penalty functions in nonlinear programming
- Metric regularity, tangent sets, and second-order optimality conditions
- Nonsmooth optimization
- Exact Penalty Functions in Constrained Optimization
- Non-Linear Programming Via Penalty Functions
- An approach to constrained global optimization based on exact penalty functions
- Optimization on metric and normed spaces
- Lagrange-type functions in constrained non-convex optimization.
- Exact penalty and error bounds in DC programming
- Steering exact penalty methods for nonlinear programming
- Title not available (Why is that?)
- A unified approach to the global exactness of penalty and augmented Lagrangian functions. I: Parametric exactness
- A unifying theory of exactness of linear penalty functions
- Strictly Positive Functionals on Vector Lattices
- Strictly positive linear functional and representation of Fréchet lattices with the Lebesgue property
- A unifying theory of exactness of linear penalty functions II: parametric penalty functions
- An exact penalty global optimization approach for mixed-integer programming problems
- A unified approach to the global exactness of penalty and augmented Lagrangian functions. II: Extended exactness
- Global optimality conditions and exact penalization
- Exact penalty functions for optimal control problems I: main theorem and free-endpoint problems
- Exact penalty property in optimization with mixed constraints via variational analysis
- Moreau-type characterizations of polar cones
- Exact penalty functions for optimal control problems. II: Exact penalization of terminal and pointwise state constraints
- A primal–dual penalty method via rounded weighted-ℓ1 Lagrangian duality
Cited In (2)
This page was built for publication: Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128773)