An -approximation method in nonlinear vector optimization

DOI10.1016/J.NA.2005.05.008MaRDI QIDQ2572170zbMATH OpenOpenAlexFDO

Authors Tadeusz Antczak

Publication date 14 November 2005

Published in Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.na.2005.05.008

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Recommendations

• AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS
• AN η-APPROXIMATION METHOD FOR NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS
• An -approximation method for multiobjective program involving invex functions
• An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions
• -approximation method for non-convex multiobjective variational problems

Cites work

• A characterization of weakly efficient points
• A new approach to multiobjective programming with a modified objective function
• A note on invex functions and duality in multiple objective optimization
• An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions
• Duality for Multiple Objective Convex Programs
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 1328995 (Why is no real title available?)
• Invex functions and constrained local minima
• Invex functions and generalized convexity in multiobjective programming
• On duality for weakly minimized vector valued optimization problems
• On generalised convex mathematical programming
• On sufficiency of the Kuhn-Tucker conditions
• Optimality conditions in multiobjective differentiable programming
• Optimality criteria and duality in multiple-objective optimization involving generalized invexity
• Proper efficiency and the theory of vector maximization
• Quasimin and quasisaddlepoint for vector optimization

Cited in

(21)

• Vector exponential penalty function method for nondifferentiable multiobjective programming problems
• A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems
• The characterization of efficiency and saddle point criteria for multiobjective optimization problem with vanishing constraints
• Modified objective function method in nonsmooth vector optimization over cones
• The \(F\)-objective function method for differentiable interval-valued vector optimization problems
• The exactness property of the vector exact \(l_{1}\) penalty function method in nondifferentiable invex multiobjective programming
• A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems
• An -approximation method for multiobjective program involving invex functions
• Saddle point criteria and duality in multiobjective programming via an η-approximation method
• AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS
• AN η-APPROXIMATION METHOD FOR NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS
• The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems
• An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions
• Characterizations of solvability of nonlinear nonconvex vectorial optimization problems in Banach spaces by \(\eta\)-approximation approach
• -approximation method for non-convex multiobjective variational problems
• Multiobjective optimization problems with modified objective functions and cone constraints and applications
• Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method
• Characterization of vector strict global minimizers of order 2 in differentiable vector optimization problems under a new approximation method
• A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with G-invex functions
• A new approximation approach for nonsmooth multiobjective interval-valued mathematical problems
• Equivalence and existence of weak Pareto optima for multiobjective optimization problems with cone constraints

This page was built for publication: An \(\eta\)-approximation method in nonlinear vector optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2572170)