An \(\eta\)-approximation method in nonlinear vector optimization
From MaRDI portal
Publication:2572170
DOI10.1016/j.na.2005.05.008zbMath1093.90053OpenAlexW2007079240MaRDI QIDQ2572170
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
Related Items (15)
A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems ⋮ The characterization of efficiency and saddle point criteria for multiobjective optimization problem with vanishing constraints ⋮ The \(F\)-objective function method for differentiable interval-valued vector optimization 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 ⋮ The Exactness Property of the Vector Exact l1 Penalty Function Method in Nondifferentiable Invex Multiobjective Programming ⋮ Characterization of vector strict global minimizers of order 2 in differentiable vector optimization problems under a new approximation method ⋮ The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems ⋮ AN η-APPROXIMATION METHOD FOR NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS ⋮ A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with \(G\)-invex functions ⋮ Modified objective function method in nonsmooth vector optimization over cones ⋮ Equivalence and existence of weak Pareto optima for multiobjective optimization problems with cone constraints ⋮ 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 ⋮ Saddle point criteria and duality in multiobjective programming via an η-approximation method
Cites Work
- Unnamed Item
- Unnamed Item
- Optimality conditions in multiobjective differentiable programming
- A note on invex functions and duality in multiple objective optimization
- On sufficiency of the Kuhn-Tucker conditions
- Invex functions and generalized convexity in multiobjective programming
- Optimality criteria and duality in multiple-objective optimization involving generalized invexity
- A new approach to multiobjective programming with a modified objective function
- A characterization of weakly efficient points
- Proper efficiency and the theory of vector maximization
- On duality for weakly minimized vector valued optimization problems
- Invex functions and constrained local minima
- Duality for Multiple Objective Convex Programs
- On generalised convex mathematical programming
- Quasimin and quasisaddlepoint for vector optimization
- An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions
This page was built for publication: An \(\eta\)-approximation method in nonlinear vector optimization
