Pages that link to "Item:Q984086"

The following pages link to Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming (Q984086):

Displaying 26 items.

• Some characterizations of robust optimal solutions for uncertain convex optimization problems (Q331984) (← links)
• Total Lagrange duality for DC infinite optimization problems (Q401875) (← links)
• Optimality conditions for nonlinear infinite programming problems (Q497442) (← links)
• On constraint qualifications of a nonconvex inequality (Q723504) (← links)
• Stable and total Fenchel duality for composed convex optimization problems (Q1617041) (← links)
• Recent contributions to linear semi-infinite optimization (Q1680760) (← links)
• Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
• Extended Farkas's lemmas and strong dualities for conic programming involving composite functions (Q1743534) (← links)
• Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization (Q1925778) (← links)
• Stationarity and regularity of infinite collections of sets (Q1937086) (← links)
• Stable zero Lagrange duality for DC conic programming (Q1952895) (← links)
• Weighted robust optimality of convex optimization problems with data uncertainty (Q2191283) (← links)
• Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems (Q2261970) (← links)
• Strong and total Lagrange dualities for quasiconvex programming (Q2336429) (← links)
• Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming (Q2338781) (← links)
• A Lagrange duality approach for multi-composed optimization problems (Q2408520) (← links)
• Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems (Q2440517) (← links)
• Some characterizations of approximate solutions for robust semi-infinite optimization problems (Q2664903) (← links)
• Some characterizations of duality for DC optimization with composite functions (Q4559389) (← links)
• Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function (Q4634099) (← links)
• Strong and total Lagrange dualities for quasiconvex programming (Q5088817) (← links)
• Optimality conditions and total dualities for conic programming involving composite function (Q5213372) (← links)
• Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings (Q5963691) (← links)
• Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization'' (Q5965674) (← links)
• On constraint qualifications for an infinite system of quasiconvex inequalities (Q6494316) (← links)
• On global error bounds for convex inequalities systems (Q6614709) (← links)