Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints

DOI10.1080/00207160.2014.925191zbMath1310.90101OpenAlexW2085106461MaRDI QIDQ5248074

Tadeusz Antczak

Publication date: 27 April 2015

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

saddle pointLagrange functionWolfe duality\((\Phi , \rho)\)-invexity

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Related Items (2)

$$\varPhi -$$ Weak Slater Constraint Qualification in Nonsmooth Multiobjective Semi-infinite Programming ⋮ Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification

Cites Work

• Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under \((\varPhi, \rho)\)-invexity
• \(r\)-preinvexity and \(r\)-invexity in mathematical programming
• Duality and saddle-points for convex-like vector optimization problems on real linear spaces
• Optimality and duality for nonsmooth multiobjective programming problems with \(V\)-\(r\)-invexity
• Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
• On sufficiency of the Kuhn-Tucker conditions
• On efficiency and duality for multiobjective programs
• \(D\)-invexity and optimality conditions
• Duality theory in multiobjective programming
• On multiple-objective optimization with generalized univexity
• Lagrange multipliers and saddle points in multiobjective programming
• A saddle-point characterization of Pareto optima
• Lipschitz B-vex functions and nonsmooth programming
• Arcwise connected cone-convex functions and mathematical programming
• A new approach to multiobjective programming with a modified objective function
• Approximate saddle-point theorems in vector optimization
• Saddle point and generalized convex duality for multiobjective programming.
• Optimality and mixed saddle point criteria in multiobjective optimization
• Strong and Weak Convexity of Sets and Functions
• (Φ, ρ)-Invexity in Nonsmooth Optimization
• Saddle point criteria and duality in multiobjective programming via an η-approximation method
• Vector maximisation and lagrange multipliers
• Optimization and nonsmooth analysis
• What is invexity?
• A class of nonconvex functions and mathematical programming
• Further Generalizations of Convexity in Mathematical Programming
• Saddle points and duality in multi-objective programming
• On generalised convex mathematical programming
• Quasimin and quasisaddlepoint for vector optimization
• Nonsmooth Invexity in Multiobjective Programming
• Generalized invexity for nonsmooth vector-valued mappings
• Generalized (F, ρ)-convexity and duality for non smooth multi-objective programs
• Optimality and Duality for Invex Nonsmooth Multiobjective programming problems
• Generalized convex composite multi-objective nonsmooth programming and conditional proper efficiency

This page was built for publication: Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints