G-saddle point criteria andG-Wolfe duality in differentiate mathematical programming

DOI10.1080/02522667.2010.10699945zbMath1242.90224MaRDI QIDQ3002325

Tadeusz Antczak

Publication date: 20 May 2011

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.2010.10699945

zbMATH Keywords

\(G\)-invex function with respect to \(\eta\); \(G\)-Karush-Kuhn-Tucker optimality conditions; \(G\)-Lagrange function; \(G\)-saddle point; \(G\)-Wolfe duality; G-F.John necessary optimality conditions

Mathematics Subject Classification ID

90C30: Nonlinear programming

90C46: Optimality conditions and duality in mathematical programming

Related Items

On duality for mathematical programs with vanishing constraints, New dualities for mathematical programs with vanishing constraints, Mathematical programs with vanishing constraints involving strongly invex functions

Cites Work

• The essence of invexity
• \(r\)-preinvexity and \(r\)-invexity in mathematical programming
• New optimality conditions and duality results of \(G\) type in differentiable mathematical programming
• \(G\)-pre-invex functions in mathematical programming
• Saddle-point criteria in an \(\eta\)-approximation method for nonlinear mathematical programming problems involving invex functions
• Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
• Optimality criteria in mathematical programming involving generalized invexity
• On sufficiency of the Kuhn-Tucker conditions
• Logarithmic convexity and geometric programming
• Invexity and generalized convexity
• What is invexity?
• Necessary and sufficient conditions in constrained optimization
• A class of nonconvex functions and mathematical programming
• Invex functions and constrained local minima
• An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions
• Convex Analysis