Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method

DOI10.1016/j.camwa.2010.09.013zbMath1205.90255OpenAlexW2037160425MaRDI QIDQ623228

Tadeusz Antczak

Publication date: 13 February 2011

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2010.09.013

zbMATH Keywords

\(\eta \)-approximated vector optimization problem\(\eta \)-saddle point\(V\)-invex functionvector-valued \(\eta \)-Lagrange function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Related Items (2)

Modified objective function method in nonsmooth vector optimization over cones ⋮ Saddle point criteria for multi-dimensional control optimisation problem involving first-order PDE constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Existence of value and saddle point in infinite-dimensional differential games.
• Multiobjective duality with invexity
• Pre-invex functions in multiple objective optimization
• Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions
• Lagrange multipliers and saddle points in multiobjective programming
• Local saddle points and convexification for nonconvex optimization problems
• A characterization of generalized saddle points for vector-valued functions via scalarization
• Existence theorems for saddle points of vector-valued maps
• Local saddle point and a class of convexification methods for nonconvex optimization problems
• Saddle points of Hamiltonian systems in convex problems of Lagrange
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• An \(\eta\)-approximation method in nonlinear vector optimization
• Optimality Conditions and Duality Theorems for Multiobjective Invex Programs
• Saddle point criteria and duality in multiobjective programming via an η-approximation method
• AN η-APPROXIMATION METHOD FOR NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS
• On duality for weakly minimized vector valued optimization problems
• On generalised convex mathematical programming
• Quasimin and quasisaddlepoint for vector optimization
• Nonsmooth Invexity in Multiobjective Programming
• Optimality and Duality for Invex Nonsmooth Multiobjective programming problems

This page was built for publication: Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method