Saddle points criteria in nondifferentiable multiobjective programming with V-invex functions via an -approximation method
From MaRDI portal
Publication:623228
DOI10.1016/J.CAMWA.2010.09.013zbMATH Open1205.90255OpenAlexW2037160425MaRDI QIDQ623228FDOQ623228
Authors: 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
Recommendations
- scientific article; zbMATH DE number 5879517
- Saddle-point criteria in an \(\eta\)-approximation method for nonlinear mathematical programming problems involving invex functions
- Saddle point criteria and duality in multiobjective programming via an η-approximation method
- Saddle points criteria via a second order \(\eta \)-approximation approach for nonlinear mathematical programming involving second order invex functions
- Saddle point criteria for semi-infinite programming problems via an \(\eta\)-approximation method
- Saddle point condition of multiple-objective semi-infinite programming with generalized invex function
- Saddle points optimality criteria and duality for multi-objective \(E\)-convex programming problems
- Mixed Type Duality and Saddle Point Criteria for Multiobjective Programming Problems with Nonsmooth Generalized Invexity
- Approximate Saddle Point and Duality for Multiobjective n-Set Optimization
- Lagrange saddle point criteria for nonsmooth semi-infinite multiobjective optimization problems
\(\eta \)-approximated vector optimization problem\(\eta \)-saddle point\(V\)-invex functionvector-valued \(\eta \)-Lagrange function
Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Title not available (Why is that?)
- Pre-invex functions in multiple objective optimization
- Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions
- Existence theorems for saddle points of vector-valued maps
- On generalised convex mathematical programming
- Local saddle point and a class of convexification methods for nonconvex optimization problems
- Existence of value and saddle point in infinite-dimensional differential games.
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Saddle points of Hamiltonian systems in convex problems of Lagrange
- An \(\eta\)-approximation method in nonlinear vector optimization
- A characterization of generalized saddle points for vector-valued functions via scalarization
- Title not available (Why is that?)
- Optimality and Duality for Invex Nonsmooth Multiobjective programming problems
- Lagrange multipliers and saddle points in multiobjective programming
- Multiobjective duality with invexity
- Local saddle points and convexification for nonconvex optimization problems
- 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
- Quasimin and quasisaddlepoint for vector optimization
- Nonsmooth Invexity in Multiobjective Programming
Cited In (11)
- Saddle point criteria for multi-dimensional control optimisation problem involving first-order PDE constraints
- Saddle-point criteria in an \(\eta\)-approximation method for nonlinear mathematical programming problems involving invex functions
- Saddle point criteria and duality in multiobjective programming via an η-approximation method
- AN η-APPROXIMATION METHOD FOR NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS
- An \(\eta\)-approximation method for multiobjective program involving invex functions
- Saddle points criteria via a second order \(\eta \)-approximation approach for nonlinear mathematical programming involving second order invex functions
- Title not available (Why is that?)
- Modified objective function method in nonsmooth vector optimization over cones
- Mixed Type Duality and Saddle Point Criteria for Multiobjective Programming Problems with Nonsmooth Generalized Invexity
- Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints
- Saddle-point optimality criteria involving (p, b, d)-invexity and (p, b, d)-pseudoinvexity in interval-valued optimisation problems
This page was built for publication: Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623228)
