A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems
DOI10.1007/S10287-020-00379-0OpenAlexW3118512281MaRDI QIDQ2033709FDOQ2033709
Authors: Tadeusz Antczak 
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
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
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Nonlinear multiobjective optimization
- Strong and Weak Convexity of Sets and Functions
- On sufficiency of the Kuhn-Tucker conditions
- On efficiency and duality for multiobjective programs
- Generalized B-vex functions and generalized B-vex programming
- Adaptive Scalarization Methods in Multiobjective Optimization
- What is invexity?
- Title not available (Why is that?)
- Further Generalizations of Convexity in Mathematical Programming
- Vector variational inequality as a tool for studying vector optimization problems
- On Minty vector variational-like inequality
- An \(\eta\)-approximation method in nonlinear vector optimization
- Scalarization in vector optimization
- Optimality conditions in multiobjective differentiable programming
- Vector variational inequalities for nondifferentiable convex vector optimization problems
- Title not available (Why is that?)
- The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems
- Optimality conditions and duality in multiobjective programming with \((\Phi,\rho)\)-invexity
- Vector variational-like inequality problem and vector optimization problem
- Kinds of vector invex
- Multiobjective duality with invexity
- 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
- Some characterizations of the optimal solutions of a vector optimization problem
- A new method of solving nonlinear mathematical programming problems involving \(r\)-invex functions
- Sufficiency and duality in multiobjective programming involving generalized \(F\)-convex functions
- Vector optimization problems and approximated vector optimization problems
- On sufficiency and duality for \((b,F,\rho)\)-convex multiobjective programs
- Modified objective function method in nonsmooth vector optimization over cones
- Optimization problems and \(\eta\)-approximated optimization problems
- Optimization problems, first order approximated optimization problems and their connections
Cited In (3)
- A sublinear functional based approximated equivalence to optimality and duality for multiobjective programming in complex spaces
- Optimality conditions and duality results for a new class of nonconvex nonsmooth vector optimization problems
- AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS
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)
