Pages that link to "Item:Q927159"

The following pages link to Complete characterizations of stable Farkas' lemma and cone-convex programming duality (Q927159):

Displaying 28 items.

• Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization (Q280088) (← links)
• Some characterizations of robust optimal solutions for uncertain convex optimization problems (Q331984) (← links)
• Robust linear semi-infinite programming duality under uncertainty (Q353146) (← links)
• Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization (Q374638) (← links)
• Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces (Q413608) (← links)
• A complete characterization of strong duality in nonconvex optimization with a single constraint (Q454276) (← links)
• Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
• Robust Farkas' lemma for uncertain linear systems with applications (Q548208) (← links)
• Robust conjugate duality for convex optimization under uncertainty with application to data classification (Q631700) (← links)
• Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems (Q663722) (← links)
• Functional inequalities and theorems of the alternative involving composite functions (Q743970) (← links)
• Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs (Q837124) (← links)
• Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming (Q984086) (← links)
• Some dual characterizations of Farkas-type results for fractional programming problems (Q1670547) (← links)
• Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap (Q1685581) (← links)
• Approximate optimality conditions for composite convex optimization problems (Q1689064) (← links)
• Extended Farkas's lemmas and strong dualities for conic programming involving composite functions (Q1743534) (← links)
• Strong duality and minimal representations for cone optimization (Q1928754) (← links)
• Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces (Q2116030) (← links)
• A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints (Q2248753) (← links)
• Exact relaxations for parametric robust linear optimization problems (Q2294277) (← links)
• Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming (Q2338781) (← links)
• Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint (Q2413092) (← links)
• The stable Farkas lemma for composite convex functions in infinite dimensional spaces (Q2516052) (← links)
• Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements (Q3225066) (← links)
• Some characterizations of duality for DC optimization with composite functions (Q4559389) (← links)
• Strong duality in robust semi-definite linear programming under data uncertainty (Q5169452) (← links)
• Optimality conditions and total dualities for conic programming involving composite function (Q5213372) (← links)