A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems
From MaRDI portal
Publication:2033709
DOI10.1007/s10287-020-00379-0OpenAlexW3118512281MaRDI QIDQ2033709
Publication date: 17 June 2021
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-020-00379-0
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems
- Kinds of vector invex
- A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with \(G\)-invex functions
- Some characterizations of the optimal solutions of a vector optimization problem
- On Minty vector variational-like inequality
- Vector variational-like inequality problem and vector optimization problem
- Optimality conditions in multiobjective differentiable programming
- Multiobjective duality with invexity
- On sufficiency of the Kuhn-Tucker conditions
- On efficiency and duality for multiobjective programs
- Nonlinear multiobjective optimization
- Generalized B-vex functions and generalized B-vex programming
- Sufficiency and duality in multiobjective programming involving generalized \(F\)-convex functions
- A new approach to multiobjective programming with a modified objective function
- On sufficiency and duality for \((b,F,\rho)\)-convex multiobjective programs
- Modified objective function method in nonsmooth vector optimization over cones
- Vector variational inequalities for nondifferentiable convex vector optimization problems
- A new method of solving nonlinear mathematical programming problems involving \(r\)-invex functions
- An \(\eta\)-approximation method in nonlinear vector optimization
- Strong and Weak Convexity of Sets and Functions
- Scalarization in vector optimization
- Adaptive Scalarization Methods in Multiobjective Optimization
- Optimality conditions and duality in multiobjective programming with invexity
- What is invexity?
- Further Generalizations of Convexity in Mathematical Programming
- Vector variational inequality as a tool for studying vector optimization problems
This page was built for publication: A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems
