The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems
From MaRDI portal
Publication:409835
DOI10.1016/j.mcm.2011.05.003zbMath1235.90143OpenAlexW1584470377MaRDI QIDQ409835
Publication date: 15 April 2012
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2011.05.003
\(G\)-invex function with respect to \(\eta \)\(G\)-penalized optimization problemabsolute value \(G\)-penalty functionexact \(G\)-penalty function method
Related Items (2)
The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming ⋮ G-penalty approach for multi-dimensional control optimisation problem with nonlinear dynamical system
Cites Work
- Unnamed Item
- \(r\)-preinvexity and \(r\)-invexity in mathematical programming
- New optimality conditions and duality results of \(G\) type in differentiable mathematical programming
- Exact penalty functions method for mathematical programming problems involving invex functions
- On sufficiency of the Kuhn-Tucker conditions
- Exact penalty functions and stability in locally Lipschitz programming
- Exact penalty functions in nonlinear programming
- Invex functions and constrained local minima
- Necessary and sufficient conditions for a penalty method to be exact
- A lower bound for the controlling parameters of the exact penalty functions
- Exact Penalty Functions in Constrained Optimization
- Sufficiency of Exact Penalty Minimization
- Non-Linear Programming Via Penalty Functions
- An Exact Potential Method for Constrained Maxima
- Exact penalty functions in nonlinear programming
This page was built for publication: The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems
