Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method
type: Item
instance of: scholarly article
title: Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method
zbMATH Open document ID: 1205.90255
author: Tadeusz Antczak
publication date: 2011-02-13T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 5851237
zbMATH Keywords: \(\eta \)-approximated vector optimization problem
zbMATH Keywords: \(\eta \)-saddle point
zbMATH Keywords: vector-valued \(\eta \)-Lagrange function
zbMATH Keywords: \(V\)-invex function
MaRDI profile type: Publication
full work available at URL: j.camwa.2010.09.013
OpenAlex ID: W2037160425
cites work: Quasimin and quasisaddlepoint for vector optimization
cites work: Multiobjective duality with invexity
cites work: Existence of value and saddle point in infinite-dimensional differential games.
cites work: Lagrange multipliers and saddle points in multiobjective programming
cites work: Local saddle point and a class of convexification methods for nonconvex optimization problems
cites work: Saddle points of Hamiltonian systems in convex problems of Lagrange
cites work: Existence theorems for saddle points of vector-valued maps
cites work: A characterization of generalized saddle points for vector-valued functions via scalarization
cites work: Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions
cites work: Pre-invex functions in multiple objective optimization
cites work: On duality for weakly minimized vector valued optimization problems
cites work: Local saddle points and convexification for nonconvex optimization problems
cites work: Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
cites work: An \(\eta\)-approximation method in nonlinear vector optimization
cites work: AN η-APPROXIMATION METHOD FOR NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS
cites work: Saddle point criteria and duality in multiobjective programming via an η-approximation method
cites work: Q4000274
cites work: On generalised convex mathematical programming
cites work: Q4257351
cites work: Optimality and Duality for Invex Nonsmooth Multiobjective programming problems
cites work: Nonsmooth Invexity in Multiobjective Programming
cites work: Optimality Conditions and Duality Theorems for Multiobjective Invex Programs
DOI: 10.1016/J.CAMWA.2010.09.013
published in: Computers & Mathematics with Applications
Recommended article: Q5393507
Recommended article: Saddle-point criteria in an \(\eta\)-approximation method for nonlinear mathematical programming problems involving invex functions
Recommended article: Saddle point criteria and duality in multiobjective programming via an η-approximation method
Recommended article: Q3008339
Recommended article: Saddle point criteria for semi-infinite programming problems via an \(\eta\)-approximation method
Recommended article: Q4980781
Recommended article: Q3105397
Recommended article: Mixed Type Duality and Saddle Point Criteria for Multiobjective Programming Problems with Nonsmooth Generalized Invexity
Recommended article: Approximate Saddle Point and Duality for Multiobjective n-Set Optimization
Recommended article: Q4623600
description: scientific article; zbMATH DE number 5851237