Exact penalty functions and stability in locally Lipschitz programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 147745
- On the \(L_ 1\) exact penalty function with locally Lipschitz functions
- scientific article; zbMATH DE number 1135771
- scientific article; zbMATH DE number 4202028
- Exact penalty in constrained optimization and critical points of Lipschitz functions
- Lower bounds of controlling parameters of exact penalty functions in locally Lipschitz programming
- Exact penalty functions in problems of nonsmooth optimization
- Exact penalty functions and Lagrange multipliers
- Existence of exact penalty and its stability for inequality-constrained optimization problems
- scientific article; zbMATH DE number 5825959
Cites work
- A dual differentiable exact penalty function
- A General Sufficiency Theorem for Nonsmooth Nonlinear Programming
- A globally convergent method for nonlinear programming
- A lower bound for the controlling parameters of the exact penalty functions
- A New Approach to Lagrange Multipliers
- A Penalty Function Method Converging Directly to a Constrained Optimum
- An Exact Potential Method for Constrained Maxima
- Convex Analysis
- Differential properties of the marginal function in mathematical programming
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- Exact penalty functions in nonlinear programming
- Exact penalty functions in nonlinear programming
- Globally Convergent Algorithms for Convex Programming
- Lagrange multipliers and subderivatives of optimal value functions in nonlinear programming
- Necessary and sufficient conditions for a penalty method to be exact
- Non-Linear Programming Via Penalty Functions
- On optimality conditions in nondifferentiable programming
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- Optimization and nonsmooth analysis
- Sufficient conditions for a globally exact penalty function without convexity
Cited in
(43)- Exact penalties and sufficient conditions for optimality in nonsmooth optimization
- Lower bounds of controlling parameters of exact penalty functions in locally Lipschitz programming
- On the \(L_ 1\) exact penalty function with locally Lipschitz functions
- \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
- Differential stability in non-Lipschitzian optimization
- An objective penalty function-based method for inequality constrained minimization problem
- Vector exponential penalty function method for nondifferentiable multiobjective programming problems
- Calmness and exact penalization in constrained scalar set-valued optimization
- Exact barrier function methods for Lipschitz programs
- Exactness and algorithm of an objective penalty function
- Convergence of a class of penalty methods for constrained scalar set-valued optimization
- Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs
- The exactness property of the vector exact \(l_{1}\) penalty function method in nondifferentiable invex multiobjective programming
- scientific article; zbMATH DE number 5825959 (Why is no real title available?)
- An M-objective penalty function algorithm under big penalty parameters
- The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming
- scientific article; zbMATH DE number 4202028 (Why is no real title available?)
- Exact penalty functions and Lagrange multipliers
- scientific article; zbMATH DE number 4135323 (Why is no real title available?)
- Exact penalty method with integrated consideration of the constraints
- ImplementableL∞penalty-function method for semi-infinite optimization
- scientific article; zbMATH DE number 16307 (Why is no real title available?)
- scientific article; zbMATH DE number 147745 (Why is no real title available?)
- The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems
- scientific article; zbMATH DE number 1135771 (Why is no real title available?)
- The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems
- Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
- Calmness and exact penalization in vector optimization under nonlinear perturbations
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
- An exact lower order penalty function and its smoothing in nonlinear programming
- Théorie de la pénalisation exacte
- Variational analysis on local sharp minima via exact penalization
- Saddle point criteria for multi-dimensional control optimisation problem involving first-order PDE constraints
- Model predictive control for tracking randomly varying references
- An adaptive competitive penalty method for nonsmooth constrained optimization
- Lower order calmness and exact penalty function
- Efficiency and approachability of nonconvex bicriteria programs
- Second-order analysis of penalty function
- A new vector exponential exact penalty approach for solving nonsmooth vector optimization problems
- Calmness and exact penalization in vector optimization with cone constraints
- On the smoothing of the square-root exact penalty function for inequality constrained optimization
- Global convergence of a semi-infinite optimization method
- Stability of exact penalty for nonconvex inequality-constrained minimization problems
This page was built for publication: Exact penalty functions and stability in locally Lipschitz programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3714912)
