On set containment characterizations for sets described by set-valued maps with applications
From MaRDI portal
Publication:2302829
Recommendations
- Set valued mappings and their applications
- scientific article; zbMATH DE number 3855795
- scientific article; zbMATH DE number 2152287
- scientific article; zbMATH DE number 2163565
- scientific article; zbMATH DE number 1380760
- scientific article; zbMATH DE number 18660
- On a set-covering property of multivalued mappings
- Set-valued maps and \(AE(0)\)-spaces
- A characterization of Dugundji spaces via set-valued maps
Cites work
- 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 1377943 (Why is no real title available?)
- A characterization of cone-convexity for set-valued functions by cone-quasiconvexity
- Characterizations of solution sets of convex vector minimization problems
- Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Characterizing global optimality for DC optimization problems under convex inequality constraints
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Conjugate duality in convex optimization
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Containment problems for polytopes and spectrahedra
- Contingent epiderivatives and set-valued optimization
- Dual characterizations of set containments with strict convex inequalities
- Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces
- Farkas-type results for vector-valued functions with applications
- Knowledge-based semidefinite linear programming classifiers
- New Farkas-type results for vector-valued functions: a non-abstract approach
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- On \(\varepsilon\)-optimality conditions for convex set-valued optimization problems
- On cone convexity of set-valued maps
- On general minimax theorems
- On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization
- On set containment characterization and constraint qualification for quasiconvex programming
- On solutions of set-valued optimization problems
- Robust counterparts and robust efficient solutions in vector optimization under uncertainty
- Scalar characterizations of cone-continuous set-valued maps
- Set containment characterization
- Set containment characterization for quasiconvex programming
- Set containment characterization with strict and weak quasiconvex inequalities
- Sums of squares characterizations of containment of convex semialgebraic sets
- Support vector machine classifiers with uncertain knowledge sets via robust optimization
- Variational methods in partially ordered spaces
Cited in
(8)- New Farkas-type results for vector-valued functions: a non-abstract approach
- Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps
- On the stable containment of two sets
- A characterization of Dugundji spaces via set-valued maps
- Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications
- Set containment characterization with strict and weak quasiconvex inequalities
- Stability of efficient solutions to set optimization problems
- Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces
This page was built for publication: On set containment characterizations for sets described by set-valued maps with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302829)
