scientific article; zbMATH DE number 16307
From MaRDI portal
Publication:3972960
We consider a class of nondifferentiable penalty functions for the solution of constrained Lipschitz programming problems, without any convexity assumption on the problem functions. We adopt a notion of exactness which appears to be of relevance in connection with the solution of the constrained problem by means of unconstrained minimization methods, and we show that the class of penalty functions considered is exact according to this notion. [For the entire collection see Zbl 0719.00020.]
Recommendations
Cited in
(41)- On the exactness of a class of nondifferentiable penalty functions
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Exact penalty functions in linear and integer linear programming
- Refinements of necessary conditions for optimality in nonlinear programming
- On the exact penalty functions
- Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems
- New exact penalty functions for nonlinear constrained optimization problems
- Partially strictly monotone and nonlinear penalty functions for constrained mathematical programs
- On solving three classes of nonlinear programming problems via simple differentiable penalty functions
- Exact barrier function methods for Lipschitz programs
- Exact penalty functions in problems of nonsmooth optimization
- Gap functions and penalization for solving equilibrium problems with nonlinear constraints
- Exact penalty and optimality condition for nonseparable continuous piecewise linear programming
- Nonconvex robust programming via value-function optimization
- Descent and penalization techniques for equilibrium problems with nonlinear constraints
- A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems
- Exact penalty functions and convex extensions of functions in schemes of decomposition in variables
- scientific article; zbMATH DE number 4135323 (Why is no real title available?)
- scientific article; zbMATH DE number 4154231 (Why is no real title available?)
- Nonsmooth optimization
- A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality Constraints
- scientific article; zbMATH DE number 3918115 (Why is no real title available?)
- scientific article; zbMATH DE number 3922396 (Why is no real title available?)
- scientific article; zbMATH DE number 4061013 (Why is no real title available?)
- scientific article; zbMATH DE number 4072730 (Why is no real title available?)
- scientific article; zbMATH DE number 4093199 (Why is no real title available?)
- scientific article; zbMATH DE number 1186922 (Why is no real title available?)
- Exact penalty functions in single-stage stochastic programming1
- Exact penalty and error bounds in DC programming
- scientific article; zbMATH DE number 500377 (Why is no real title available?)
- Exact penalization via dini and hadamard conditional derivatives
- The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems
- scientific article; zbMATH DE number 6804666 (Why is no real title available?)
- scientific article; zbMATH DE number 205760 (Why is no real title available?)
- Exact Penalty Functions in Constrained Optimization
- Exact penalization of generalized Nash equilibrium problems
- Multicomposite nonconvex optimization for training deep neural networks
- The exact penalty map for nonsmooth and nonconvex optimization
- Penalty methods for a class of non-Lipschitz optimization problems
- scientific article; zbMATH DE number 7733439 (Why is no real title available?)
- Data-efficient global extremum seeking framework for constrained optimization of nonlinear dynamical systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972960)
