Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps
From MaRDI portal
Publication:2176278
In recent years, vector optimization problems with set-valued maps have received increasing attention. In this work, the authors establish sequential optimality conditions for approximate weak Pareto solutions for a convex vector optimization problem with set-valued maps (without any constraint qualification) by using some cone-convexity notions and the scalarization technique. Then, a new sequential form of Lagrange multiplier condition for approximate optimality in terms of approximate subdifferentials is obtained. The obtained results differ from other sequential optimality results established in the literature, where the scalarization function the so-called oriented distance functions and coderivatives are considered.
Recommendations
- Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps
- Some properties of approximate solutions for vector optimization problem with set-valued functions
- Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
- A Lagrangian multiplier theorem of -weakly efficient solutions in vector optimization problems with set-valued maps
- Sequential characterization of solutions in convex composite programming and applications to vector optimization
Cites work
- -optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
- A cone-continuity constraint qualification and algorithmic consequences
- A new sequential optimality condition for constrained optimization and algorithmic consequences
- A note on approximate Karush-Kuhn-Tucker conditions in locally Lipschitz multiobjective optimization
- A practical optimality condition without constraint qualifications for nonlinear programming
- A simple closure condition for the normal cone intersection formula
- Approximate KKT points and a proximity measure for termination
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems
- Conjugate duality in convex optimization
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Contingent epiderivatives and set-valued optimization
- Convergence detection for optimization algorithms: approximate-KKT stopping criterion when Lagrange multipliers are not available
- e-weak minimal solutions of vector optimization problems with set-valued maps
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- scientific article; zbMATH DE number 5245384 (Why is no real title available?)
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- Lagrange multipliers for set-valued optimization problems associated with coderivatives
- Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
- Liberating the subgradient optimality conditions from constraint qualifications
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Nonsmooth sequential analysis in Asplund spaces
- On -optimality conditions for convex set-valued optimization problems
- On cone convexity of set-valued maps
- On set containment characterizations for sets described by set-valued maps with applications
- On subdifferentials of set-valued maps
- On the Subdifferentiability of Convex Functions
- Optimality conditions in non-convex set-valued optimization
- Scalar characterizations of cone-continuous set-valued maps
- Scalar multiplier rules in set-valued optimization
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming
- The Lagrange Multiplier Rule for Multifunctions in Banach Spaces
- The Lagrange Multiplier Rule in Set-Valued Optimization
- Variational analysis and applications
- Variational methods in partially ordered spaces
- Weak and proper efficiency in set-valued optimization on real linear spaces
- ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
- ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS
Cited in
(11)- Sequential characterization of solutions in convex composite programming and applications to vector optimization
- Stability of efficient solutions to set optimization problems
- Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps
- Optimality conditions with sequences in basic vector optimization
- Improved sequential optimality conditions for vector optimization problems with cone-epi-closed functions
- Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
- Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming
- Sequential Pareto subdifferential sum rule for convex set-valued mappings and applications
- On characterizations of solution sets of interval-valued quasiconvex programming problems
- Nonlinear scalarizations in set optimization with variable ordering structures and applications
- Some properties of approximate solutions for vector optimization problem with set-valued functions
This page was built for publication: Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176278)
