Necessary and sufficient conditions for a penalty method to be exact

Cites work

scientific article; zbMATH DE number 3307153 (Why is no real title available?)
A Penalty Function Method Converging Directly to a Constrained Optimum
An Exact Potential Method for Constrained Maxima
Combined Primal–Dual and Penalty Methods for Convex Programming
Constrained Optimization Using a Nondifferentiable Penalty Function
Convex Analysis
Exact penalty functions in nonlinear programming
New Conditions for Exactness of a Simple Penalty Function
Non-Linear Programming Via Penalty Functions
Variation of the penalty coefficient in linear programming problems

Cited in

(62)

A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils
Weak sharpness and finite convergence for solutions of nonsmooth variational inequalities in Hilbert spaces
Solving minimum norm problems using penalty functions and the gradient method
Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework
Implementing a smooth exact penalty function for equality-constrained nonlinear optimization
Minimum and maximum principle sufficiency properties for nonsmooth variational inequalities
Nonsmooth optimization
Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions
Exact penalty functions and stability in locally Lipschitz programming
Block coordinate descent methods for semidefinite programming
Weak sharp solutions for nonsmooth variational inequalities
Global minimization of constrained problems with discontinuous penalty functions
Piecewise-linear pathways to the optimal solution set in linear programming
Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks
Implementing proximal point methods for linear programming
Multiplier methods: A survey
An exact penalty function based on the projection matrix
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design
Distributed proximal-gradient method for convex optimization with inequality constraints
New simple exact penalty function for constrained minimization
CVXGEN: a code generator for embedded convex optimization
Augmented Lagrangian algorithms for linear programming
\(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
Minimum principle sufficiency
Smoothed penalty algorithms for optimization of nonlinear models
The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems
Exact penalty functions in nonlinear programming
Multisymplectic variational integrators for nonsmooth Lagrangian continuum mechanics
Convergence analysis of a proximal newton method¹
Error forgetting of Bregman iteration
Second-order analysis of penalty function
Decomposition approaches for constrained spatial auction market problems
\(\varepsilon\)-optimality and duality for multiobjective fractional programming
A new augmented Lagrangian function for inequality constraints in nonlinear programming problems
Generalized Lyapunov approach for convergence of neural networks with discontinuous or non-Lipschitz activations
Exact barrier function methods for Lipschitz programs
A hierarchical algorithm for vehicle-to-grid integration under line capacity constraints
Exact penalty functions and Lagrange multipliers
Implementing a smooth exact penalty function for general constrained nonlinear optimization
A minimization method for the sum of a convex function and a continuously differentiable function
A few remarks on penalty and penalty-duality methods in fluid-structure interactions
Image space approach to penalty methods
On the convergence of the exponential multiplier method for convex programming
Some aspects of nonsmooth variational inequalities on Hadamard manifolds
Application of the Armijo stepsize rule to the solution of a nonlinear system of equalities and inequalities
A strong duality theorem for the minimum of a family of convex programs
A distributed continuous time consensus algorithm for maximize social welfare in micro grid
Multipliers and general Lagrangians
A first order, exact penalty function algorithm for equality constrained optimization problems
A lagrangian penalty function method for monotone variational inequalities
A globally convergent algorithm for exact penalty functions
Penalty-proximal methods in convex programming
Distributed coordination for nonsmooth convex optimization via saddle-point dynamics
New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems
Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints
A centre-free approach for resource allocation with lower bounds
Linear programming with nonparametric penalty programs and iterated thresholding
Théorie de la pénalisation exacte
Distributed Bregman-distance algorithms for min-max optimization
Distributed predefined-time optimal economic dispatch for microgrids
Distributed delay-tolerant strategies for equality-constraint sum-preserving resource allocation

This page was built for publication: Necessary and sufficient conditions for a penalty method to be exact

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4090135)