A note on the paper ``Optimality conditions for vector optimization problems with difference of convex maps

DOI10.1007/S10957-019-01530-XMaRDI QIDQ2317857zbMATH OpenOpenAlexFDO

Authors Allahkaram Shafie, Farid Bozorgnia

Publication date 13 August 2019

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1902.03292

zbMATH Keywords

convex mappinglocal weak minimal solutionoptimality conditionPareto minimal pointsubdifferential

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Abstract: In this work, some counterexamples are given to refute some results reported in the paper by Guo and Li [8] (J Optim Theory Appl 162,(2014), 821-844). We correct the faulty in some of their theorems and we present alternative proofs. Moreover, we extend the definition of approximately pseudo-dissipative in the setting of metrizable topological vector spaces.

Recommendations

• On the optimality conditions for D.C. vector optimization problems
• Optimality conditions for vector optimization problems with difference of convex maps
• Corrigendum to ``Optimality conditions using approximations for nonsmooth vector optimization problems under general inequality constraints
• A note on the paper “Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints”
• Optimality conditions for vector optimization problems of a difference of convex mappings

Cites work

• Convex analysis and global optimization
• Duality and Farkas-type results for DC infinite programming with inequality constraints
• scientific article; zbMATH DE number 6508514 (Why is no real title available?)
• Local and global optimality conditions for dc infinite optimization problems
• Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems
• Optimality conditions for vector optimization problems with difference of convex maps
• Optimization of set-valued functions
• Qualification and optimality conditions for dc programs with infinite constraints
• Stable strong and total parametrized dualities for DC optimization problems in locally convex spaces
• Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
• Sufficient optimality condition for vector optimization problems under D.C. data
• The directional subdifferential of the difference of two convex functions
• The strong duality for DC optimization problems with composite convex functions

Cited in

(6)

• On the optimality conditions for D.C. vector optimization problems
• Corrigendum to ``Optimality conditions using approximations for nonsmooth vector optimization problems under general inequality constraints
• Focus on sufficient optimality conditions in D.C. vector optimization
• Corrigendum to ‘Infinite-dimensional vector optimization and a separation theorem’
• Optimality conditions for -weak local quasi-efficient solutions of D.C. vector optimization problems
• -weak Pareto minimality in D. C. vector optimization

This page was built for publication: A note on the paper ``Optimality conditions for vector optimization problems with difference of convex maps

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