Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates
From MaRDI portal
Publication:2128773
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3177945 (Why is no real title available?)
- scientific article; zbMATH DE number 3249572 (Why is no real title available?)
- A primal–dual penalty method via rounded weighted-ℓ1 Lagrangian duality
- 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
- A unifying theory of exactness of linear penalty functions
- A unifying theory of exactness of linear penalty functions II: parametric penalty functions
- An approach to constrained global optimization based on exact penalty functions
- An exact penalty global optimization approach for mixed-integer programming problems
- Exact Penalty Functions in Constrained Optimization
- Exact penalty and error bounds in DC programming
- Exact penalty functions for optimal control problems I: main theorem and free-endpoint problems
- Exact penalty functions for optimal control problems. II: Exact penalization of terminal and pointwise state constraints
- Exact penalty functions in nonlinear programming
- Exact penalty property in optimization with mixed constraints via variational analysis
- Global optimality conditions and exact penalization
- Lagrange-type functions in constrained non-convex optimization.
- Metric regularity, tangent sets, and second-order optimality conditions
- Moreau-type characterizations of polar cones
- Non-Linear Programming Via Penalty Functions
- Nonsmooth optimization
- Optimization on metric and normed spaces
- Steering exact penalty methods for nonlinear programming
- Strictly Positive Functionals on Vector Lattices
- Strictly positive linear functional and representation of Fréchet lattices with the Lebesgue property
- Trust Region Methods
- Variations and extension of the convex-concave procedure
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)
