Saddle-point criteria in an \(\eta\)-approximation method for nonlinear mathematical programming problems involving invex functions

DOI10.1007/s10957-006-9069-9zbMath1138.90027OpenAlexW2080323706MaRDI QIDQ995949

Tadeusz Antczak

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

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Numerical methods based on nonlinear programming (49M37)

Related Items (6)

Unnamed Item ⋮ 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 ⋮ Duality for a fractional variational formulation using $\eta$-approximated method ⋮ G-saddle point criteria andG-Wolfe duality in differentiate mathematical programming ⋮ On the relationships between \(G\)-preinvex functions and semistrictly \(G\)-preinvex functions

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

This page was built for publication: Saddle-point criteria in an \(\eta\)-approximation method for nonlinear mathematical programming problems involving invex functions