Saddle-point criteria in an \(\eta\)-approximation method for nonlinear mathematical programming problems involving invex functions
From MaRDI portal
Publication:995949
DOI10.1007/s10957-006-9069-9zbMath1138.90027MaRDI QIDQ995949
Publication date: 10 September 2007
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-006-9069-9
90C30: Nonlinear programming
90C46: Optimality conditions and duality in mathematical programming
49M37: Numerical methods based on nonlinear programming
Related Items
On equivalence between a variational problem and its modified variational problem with the η‐objective function under invexity, Optimality and duality in vector optimization involving generalized type I functions over cones, On the relationships between \(G\)-preinvex functions and semistrictly \(G\)-preinvex functions, Unnamed Item, G-saddle point criteria andG-Wolfe duality in differentiate mathematical programming
Cites Work
- On sufficiency of the Kuhn-Tucker conditions
- On the gap functions of prevariational inequalities
- A linearization approach to multiobjective programming duality
- What is invexity?
- Invex functions and constrained local minima
- An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions
- Nonlinear Programming
- Convex Analysis