Pages that link to "Item:Q4441971"

The following pages link to New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs (Q4441971):

Displaying 50 items.

• On \(\epsilon\)-solutions for robust fractional optimization problems (Q261808) (← links)
• On \(\epsilon\)-solutions for convex optimization problems with uncertainty data (Q270047) (← links)
• Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization (Q374638) (← links)
• \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints (Q377740) (← links)
• Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces (Q413608) (← links)
• New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs (Q425803) (← links)
• Optimality theorems for convex semidefinite vector optimization problems (Q425863) (← links)
• Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty (Q432370) (← links)
• Role of \((\rho , \eta , A)\)-invexity to \(\varepsilon \)-optimality conditions for multiple objective fractional programming (Q440729) (← links)
• Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
• Farkas-type results for constrained fractional programming with DC functions (Q479261) (← links)
• \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions (Q536840) (← links)
• New strong duality results for convex programs with separable constraints (Q613429) (← links)
• Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization (Q618891) (← links)
• Robust conjugate duality for convex optimization under uncertainty with application to data classification (Q631700) (← links)
• Optimality criteria without constraint qualifications for linear semidefinite problems (Q690528) (← links)
• On robust duality for fractional programming with uncertainty data (Q743463) (← links)
• Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) (Q819950) (← links)
• Study of a special nonlinear problem arising in convex semi-infinite programming (Q844519) (← links)
• Liberating the subgradient optimality conditions from constraint qualifications (Q857800) (← links)
• \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints (Q962489) (← links)
• Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming (Q984086) (← links)
• Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices (Q987504) (← links)
• \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints (Q1028592) (← links)
• Optimality conditions and duality for DC programming in locally convex spaces (Q1035476) (← links)
• Stable and total Fenchel duality for composed convex optimization problems (Q1617041) (← links)
• Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (Q1667169) (← 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)
• On quasi \(\epsilon\)-solution for robust convex optimization problems (Q1686550) (← links)
• Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs (Q1706408) (← links)
• A note on optimality conditions for DC programs involving composite functions (Q1722334) (← links)
• On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
• Sequential Lagrangian conditions for convex programs with applications to semidefinite programming (Q1781864) (← links)
• Implicit optimality criterion for convex SIP problem with box constrained index set (Q1939083) (← links)
• On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems (Q1952121) (← links)
• Stable zero Lagrange duality for DC conic programming (Q1952895) (← links)
• A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (Q1984696) (← links)
• Simple bilevel programming and extensions (Q2039237) (← links)
• Strong duality for standard convex programs (Q2074838) (← links)
• On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization (Q2091085) (← links)
• On strong duality in linear copositive programming (Q2149604) (← links)
• On approximate efficiency for nonsmooth robust vector optimization problems (Q2153390) (← links)
• Sequential approximate weak optimality conditions for multiobjective fractional programming problems via sequential calculus rules for the Brøndsted-Rockafellar approximate subdifferential (Q2154691) (← links)
• Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps (Q2176278) (← links)
• On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods (Q2227537) (← links)
• Sequential optimality conditions for fractional optimization with applications to vector optimization (Q2260685) (← links)
• Optimality and duality in nonsmooth conic vector optimization (Q2275322) (← links)
• A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty (Q2275574) (← links)
• On set containment characterizations for sets described by set-valued maps with applications (Q2302829) (← links)