Saddle-point type optimality criteria for optimization problem over cones.

DOI10.1007/BF03398686zbMath1214.90110OpenAlexW2772781422MaRDI QIDQ2477087

Seema Khurana, Surjeet Kaur Suneja

Publication date: 13 March 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398686

zbMATH Keywords

optimizationarcwise connectedconessaddle point optimalityarcwise cone-connected

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Related Items (1)

Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization

Cites Work

• Generalized arcwise-connected functions and characterizations of local- global minimum properties
• On sufficiency of the Kuhn-Tucker conditions
• Perfect duality for convexlike programs
• Optimality conditions and duality involving arcwise connected and generalized arcwise connected functions
• Fritz-John optimality and duality for non-convex programs
• Arcwise cone connected functions and optimality.
• Arcwise connected functions and applications in multiobjective optimization
• Convexlike alternative theorems and mathematical programming
• Scalarization and lagrange duality in multiobjective optimization
• Vector optimization for a class of nonconvex functions

This page was built for publication: Saddle-point type optimality criteria for optimization problem over cones.