Set containment characterization

DOI10.1023/A:1021207718605MaRDI QIDQ1810880zbMATH OpenOpenAlexFDO

Authors O. L. Mangasarian

Publication date 9 June 2003

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1021207718605

zbMATH Keywords

Quadratic programmingLinear programmingKnowledge-based classifierSet containment

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Traffic problems in operations research (90B20)

Recommendations

• Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
• Dual characterizations of set containments with strict convex inequalities
• Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces
• Sums of squares characterizations of containment of convex semialgebraic sets
• Learning Theory and Kernel Machines

Cited in

(30)

• A semidefinite hierarchy for containment of spectrahedra
• Boolean trends in linear inequalities
• Quantitative analysis for perturbed abstract inequality systems in Banach spaces
• Recent advances in nonconvex semi-infinite programming: applications and algorithms
• The Farkas Lemma revisited
• On set containment characterization and constraint qualification for quasiconvex programming
• Duality theorems for quasiconvex programming with a reverse quasiconvex constraint
• Set containment characterization with strict and weak quasiconvex inequalities
• Deciding robust feasibility and infeasibility using a set containment approach: an application to stationary passive gas network operations
• Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
• On set containment characterizations for sets described by set-valued maps with applications
• Vector topical functions and Farkas type theorems with applications
• Rejoinder on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
• Generalized semi-infinite programming: a tutorial
• Farkas-type theorems for positively homogeneous systems in ordered topological vector spaces
• Functional inequalities and theorems of the alternative involving composite functions
• Analyzing linear systems containing strict inequalities via evenly convex hulls
• New Farkas-type constraint qualifications in convex infinite programming
• Farkas-type results for max-functions and applications
• Characterizations of solution sets of convex vector minimization problems
• On the stable containment of two sets
• Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications
• A collision detection approach for maximizing the material utilization
• Set containment characterization for quasiconvex programming
• Stability of the intersection of solution sets of semi-infinite systems
• How to solve a semi-infinite optimization problem
• Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces
• Characterizing robust set containments and solutions of uncertain linear programs without qualifications
• Dual characterizations of set containments with strict convex inequalities
• Correct-By-Construction Exploration and Exploitation for Unknown Linear Systems Using Bilinear Optimization

This page was built for publication: Set containment characterization

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