A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems
From MaRDI portal
Publication:2033709
Recommendations
- scientific article; zbMATH DE number 7165389
- A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with \(G\)-invex functions
- An \(\eta\)-approximation method in nonlinear vector optimization
- Characterization of vector strict global minimizers of order 2 in differentiable vector optimization problems under a new approximation method
- Optimality conditions and duality results for a new class of nonconvex nonsmooth vector optimization problems
Cites work
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 1328995 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A new approach to multiobjective programming with a modified objective function
- A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with \(G\)-invex functions
- A new method of solving nonlinear mathematical programming problems involving \(r\)-invex functions
- Adaptive Scalarization Methods in Multiobjective Optimization
- An \(\eta\)-approximation method in nonlinear vector optimization
- Further Generalizations of Convexity in Mathematical Programming
- Generalized B-vex functions and generalized B-vex programming
- Kinds of vector invex
- Modified objective function method in nonsmooth vector optimization over cones
- Multiobjective duality with invexity
- Nonlinear multiobjective optimization
- On Minty vector variational-like inequality
- On efficiency and duality for multiobjective programs
- On sufficiency and duality for \((b,F,\rho)\)-convex multiobjective programs
- On sufficiency of the Kuhn-Tucker conditions
- Optimality conditions and duality in multiobjective programming with \((\Phi,\rho)\)-invexity
- Optimality conditions in multiobjective differentiable programming
- Optimization problems and \(\eta\)-approximated optimization problems
- Optimization problems, first order approximated optimization problems and their connections
- Scalarization in vector optimization
- Some characterizations of the optimal solutions of a vector optimization problem
- Strong and Weak Convexity of Sets and Functions
- Sufficiency and duality in multiobjective programming involving generalized \(F\)-convex functions
- The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems
- Vector optimization problems and approximated vector optimization problems
- Vector variational inequalities for nondifferentiable convex vector optimization problems
- Vector variational inequality as a tool for studying vector optimization problems
- Vector variational-like inequality problem and vector optimization problem
- What is invexity?
Cited in
(3)- AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS
- Optimality conditions and duality results for a new class of nonconvex nonsmooth vector optimization problems
- A sublinear functional based approximated equivalence to optimality and duality for multiobjective programming in complex spaces
This page was built for publication: A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2033709)
