Pages that link to "Item:Q4441931"

The following pages link to Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints (Q4441931):

Displaying 43 items.

• Necessary and sufficient constraint qualification for surrogate duality (Q415371) (← links)
• Duality and Farkas-type results for DC fractional programming with DC constraints (Q552120) (← links)
• Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization (Q618891) (← links)
• On set containment characterization and constraint qualification for quasiconvex programming (Q637546) (← links)
• Functional inequalities and theorems of the alternative involving composite functions (Q743970) (← links)
• Motzkin decomposition of closed convex sets (Q847066) (← links)
• Liberating the subgradient optimality conditions from constraint qualifications (Q857800) (← links)
• Farkas-type results for max-functions and applications (Q865005) (← links)
• Some new Farkas-type results for inequality systems with DC functions (Q925237) (← links)
• Stability of the intersection of solution sets of semi-infinite systems (Q929613) (← links)
• On the stable containment of two sets (Q934810) (← links)
• Characterizing robust set containments and solutions of uncertain linear programs without qualifications (Q974991) (← links)
• Set containment characterization with strict and weak quasiconvex inequalities (Q975772) (← links)
• Some Farkas-type results for fractional programming problems with DC functions (Q1015085) (← links)
• Set containment characterization for quasiconvex programming (Q1041441) (← links)
• Efficient and weakly efficient solutions for the vector topical optimization (Q1634800) (← links)
• On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
• Duality theorems for quasiconvex programming with a reverse quasiconvex constraint (Q1750686) (← links)
• Sequential Lagrangian conditions for convex programs with applications to semidefinite programming (Q1781864) (← links)
• Continuity of cone-convex functions (Q1926629) (← links)
• Duality and Farkas-type results for extended Ky Fan inequalities with DC functions (Q1941193) (← links)
• Vector topical functions and Farkas type theorems with applications (Q2017838) (← links)
• Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty (Q2108799) (← links)
• Conic linear programming duals for classes of quadratic semi-infinite programs with applications (Q2156392) (← links)
• Lagrange duality in canonical DC programming (Q2258474) (← links)
• Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces (Q2271148) (← links)
• On set containment characterizations for sets described by set-valued maps with applications (Q2302829) (← links)
• Surrogate duality for robust optimization (Q2356091) (← links)
• Farkas-type results for fractional programming problems (Q2371162) (← links)
• Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities (Q2474349) (← links)
• An alternative formulation for a new closed cone constraint qualification (Q2492444) (← links)
• Dual characterizations of set containments with strict convex inequalities (Q2494477) (← links)
• Farkas-type results for inequality systems with composed convex functions via conjugate duality (Q2497401) (← links)
• Characterizations of solution sets of convex vector minimization problems (Q2503214) (← links)
• Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation (Q2566244) (← links)
• Analyzing linear systems containing strict inequalities via evenly convex hulls (Q2572879) (← links)
• A new geometric condition for Fenchel's duality in infinite dimensional spaces (Q2576721) (← links)
• Weaker conditions for subdifferential calculus of convex functions (Q2630793) (← links)
• Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications (Q2661520) (← links)
• Knowledge-based semidefinite linear programming classifiers (Q3423589) (← links)
• New Farkas-type constraint qualifications in convex infinite programming (Q5428420) (← links)
• Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems (Q6103695) (← links)
• On second-order conic programming duals for robust convex quadratic optimization problems (Q6160375) (← links)