Pages that link to "Item:Q3608976"

The following pages link to Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization (Q3608976):

Displaying 50 items.

• On \(\epsilon\)-solutions for convex optimization problems with uncertainty data (Q270047) (← links)
• Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
• Constraint qualifications in convex vector semi-infinite optimization (Q320868) (← links)
• Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs (Q353157) (← links)
• Normal subdifferentials of efficient point multifunctions in parametric vector optimization (Q360483) (← links)
• Fréchet subdifferentials of efficient point multifunctions in parametric vector optimization (Q386471) (← links)
• Total Lagrange duality for DC infinite optimization problems (Q401875) (← links)
• Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming (Q412765) (← links)
• Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces (Q413608) (← links)
• Necessary and sufficient constraint qualification for surrogate duality (Q415371) (← links)
• Isolated and proper efficiencies in semi-infinite vector optimization problems (Q467444) (← links)
• Sandwich theorem for quasiconvex functions and its applications (Q531868) (← links)
• Necessary optimality conditions for nonsmooth semi-infinite programming problems (Q537966) (← links)
• Clarke coderivatives of efficient point multifunctions in parametric vector optimization (Q603038) (← links)
• Optimality conditions and the basic constraint qualification for quasiconvex programming (Q622397) (← links)
• On set containment characterization and constraint qualification for quasiconvex programming (Q637546) (← links)
• A note on nonconvex minimax theorem with separable homogeneous polynomials (Q637566) (← links)
• On constraint qualifications of a nonconvex inequality (Q723504) (← links)
• Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming (Q724901) (← links)
• Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming (Q984086) (← links)
• Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications (Q1615937) (← links)
• On several types of basic constraint qualifications via coderivatives for generalized equations (Q1637351) (← links)
• On approximate solutions for robust convex semidefinite optimization problems (Q1670443) (← links)
• Characterizations of robust solution set of convex programs with uncertain data (Q1670545) (← links)
• Recent contributions to linear semi-infinite optimization (Q1680760) (← links)
• Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets (Q1682971) (← links)
• Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs (Q1706408) (← links)
• Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
• Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications (Q1740163) (← links)
• Extended Farkas's lemmas and strong dualities for conic programming involving composite functions (Q1743534) (← links)
• Duality theorems for quasiconvex programming with a reverse quasiconvex constraint (Q1750686) (← links)
• Some constraint qualifications for quasiconvex vector-valued systems (Q1945503) (← links)
• Derivatives of the efficient point multifunction in parametric vector optimization problems (Q1949603) (← links)
• A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (Q1984696) (← links)
• Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential (Q2022228) (← links)
• Robust constrained best approximation with nonconvex constraints (Q2022294) (← links)
• Duality for robust linear infinite programming problems revisited (Q2022437) (← links)
• Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications (Q2025164) (← links)
• Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data (Q2037900) (← links)
• Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs (Q2076392) (← links)
• On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization (Q2091085) (← links)
• Duality for the robust sum of functions (Q2174920) (← links)
• Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty (Q2188944) (← links)
• Duality theorems for convex and quasiconvex set functions (Q2225642) (← links)
• Duality for constrained robust sum optimization problems (Q2230940) (← links)
• Nonsmooth semi-infinite multiobjective optimization problems (Q2251568) (← links)
• Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems (Q2261970) (← links)
• Strong and total Fenchel dualities for robust convex optimization problems (Q2262012) (← links)
• Optimality conditions and constraint qualifications for quasiconvex programming (Q2278888) (← links)
• On \(\epsilon\)-solutions for robust semi-infinite optimization problems (Q2321908) (← links)