Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
From MaRDI portal
Publication:4441931
DOI10.1137/S1052623402401944zbMath1038.90061OpenAlexW2044845604MaRDI QIDQ4441931
Publication date: 19 January 2004
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623402401944
conjugate functionset containmentreverse-convex setinfinite convex constraintsknowledge-based classifier
Related Items (50)
Farkas-type results for fractional programming problems ⋮ Efficient and weakly efficient solutions for the vector topical optimization ⋮ Weaker conditions for subdifferential calculus of convex functions ⋮ Motzkin decomposition of closed convex sets ⋮ Liberating the subgradient optimality conditions from constraint qualifications ⋮ Conic linear programming duals for classes of quadratic semi-infinite programs with applications ⋮ Farkas-type results for max-functions and applications ⋮ Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications ⋮ Continuity of cone-convex functions ⋮ Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization ⋮ Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems ⋮ Necessary and sufficient constraint qualification for surrogate duality ⋮ Duality and Farkas-type results for extended Ky Fan inequalities with DC functions ⋮ On second-order conic programming duals for robust convex quadratic optimization problems ⋮ On set containment characterization and constraint qualification for quasiconvex programming ⋮ Farkas-Type Theorems and Applications: From IPH Functions to ICR Functions ⋮ Some new Farkas-type results for inequality systems with DC functions ⋮ Stability of the intersection of solution sets of semi-infinite systems ⋮ Closedness of a convex cone and application by means of the end set of a convex set ⋮ On the stable containment of two sets ⋮ Closedness of a convex cone and application by means of the end set of a convex set ⋮ DC approach to weakly convex optimization and nonconvex quadratic optimization problems ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint ⋮ Duality theorems for quasiconvex programming with a reverse quasiconvex constraint ⋮ Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities ⋮ Lagrange duality in canonical DC programming ⋮ Duality and Farkas-type results for DC fractional programming with DC constraints ⋮ New Farkas-type constraint qualifications in convex infinite programming ⋮ Characterizing robust set containments and solutions of uncertain linear programs without qualifications ⋮ Set containment characterization with strict and weak quasiconvex inequalities ⋮ An alternative formulation for a new closed cone constraint qualification ⋮ Dual characterizations of set containments with strict convex inequalities ⋮ Vector topical functions and Farkas type theorems with applications ⋮ Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces ⋮ Farkas-type results for inequality systems with composed convex functions via conjugate duality ⋮ Sequential Lagrangian conditions for convex programs with applications to semidefinite programming ⋮ Characterizations of solution sets of convex vector minimization problems ⋮ Functional inequalities and theorems of the alternative involving composite functions ⋮ Some Farkas-type results for fractional programming problems with DC functions ⋮ On set containment characterizations for sets described by set-valued maps with applications ⋮ The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces ⋮ Support vector machine classifiers with uncertain knowledge sets via robust optimization ⋮ Set containment characterization for quasiconvex programming ⋮ Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation ⋮ Knowledge-based semidefinite linear programming classifiers ⋮ Analyzing linear systems containing strict inequalities via evenly convex hulls ⋮ A Semidefinite Hierarchy for Containment of Spectrahedra ⋮ A new geometric condition for Fenchel's duality in infinite dimensional spaces ⋮ Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty ⋮ Surrogate duality for robust optimization
This page was built for publication: Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
