The exact G-penalty function method and G-invex mathematical programming problems
From MaRDI portal
(Redirected from Publication:409835)
The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems
The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems
Recommendations
- A new exact exponential penalty function method and nonconvex mathematical programming
- Exact penalty functions method for mathematical programming problems involving invex functions
- The \(l_1\) exact exponential penalty function method with \((p,r)-\rho-(\eta,\theta)\)-invexity
- The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems
- THE l1 PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS
Cites work
- scientific article; zbMATH DE number 41026 (Why is no real title available?)
- A lower bound for the controlling parameters of the exact penalty functions
- An Exact Potential Method for Constrained Maxima
- Exact Penalty Functions in Constrained Optimization
- Exact penalty functions and stability in locally Lipschitz programming
- Exact penalty functions in nonlinear programming
- Exact penalty functions in nonlinear programming
- Exact penalty functions method for mathematical programming problems involving invex functions
- Invex functions and constrained local minima
- Necessary and sufficient conditions for a penalty method to be exact
- New optimality conditions and duality results of \(G\) type in differentiable mathematical programming
- Non-Linear Programming Via Penalty Functions
- On sufficiency of the Kuhn-Tucker conditions
- Sufficiency of Exact Penalty Minimization
- \(r\)-preinvexity and \(r\)-invexity in mathematical programming
Cited in
(6)- scientific article; zbMATH DE number 3982925 (Why is no real title available?)
- Penalty function methods and a duality gap for invex optimization problems
- G-penalty approach for multi-dimensional control optimisation problem with nonlinear dynamical system
- Exact penalty functions method for mathematical programming problems involving invex functions
- A new exact exponential penalty function method and nonconvex mathematical programming
- The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming
This page was built for publication: The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409835)