On set containment characterizations for sets described by set-valued maps with applications
From MaRDI portal
Publication:2302829
DOI10.1007/s10957-019-01605-9zbMath1434.49014OpenAlexW2988735371MaRDI QIDQ2302829
Nithirat Sisarat, Rabian Wangkeeree, Gue Myung Lee
Publication date: 26 February 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-019-01605-9
Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Set-valued maps in general topology (54C60) Convex functions and convex programs in convex geometry (52A41)
Related Items (2)
Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps ⋮ Stability of efficient solutions to set optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization
- On solutions of set-valued optimization problems
- On set containment characterization and constraint qualification for quasiconvex programming
- On general minimax theorems
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Set containment characterization with strict and weak quasiconvex inequalities
- On \(\varepsilon\)-optimality conditions for convex set-valued optimization problems
- Conjugate duality in convex optimization
- Set containment characterization for quasiconvex programming
- Contingent epiderivatives and set-valued optimization
- Variational methods in partially ordered spaces
- Robust counterparts and robust efficient solutions in vector optimization under uncertainty
- Set containment characterization
- Characterizing global optimality for DC optimization problems under convex inequality constraints
- Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems
- Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces
- New Farkas-type results for vector-valued functions: a non-abstract approach
- A characterization of cone-convexity for set-valued functions by cone-quasiconvexity
- Farkas-type results for vector-valued functions with applications
- Dual characterizations of set containments with strict convex inequalities
- Characterizations of solution sets of convex vector minimization problems
- Scalar characterizations of cone-continuous set-valued maps
- Containment Problems for Polytopes and Spectrahedra
- Knowledge-based semidefinite linear programming classifiers
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
- On cone convexity of set-valued maps
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Support vector machine classifiers with uncertain knowledge sets via robust optimization
This page was built for publication: On set containment characterizations for sets described by set-valued maps with applications
