Pages that link to "Item:Q1263531"

The following pages link to Zero duality gaps in infinite-dimensional programming (Q1263531):

Displaying 38 items.

• Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem (Q378279) (← links)
• New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs (Q425803) (← links)
• New glimpses on convex infinite optimization duality (Q496382) (← links)
• On epsilon-stability in optimization (Q684048) (← links)
• Convex composite multi-objective nonsmooth programming (Q687035) (← links)
• Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations (Q721169) (← links)
• Inequality systems and optimization (Q811410) (← links)
• Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs (Q837124) (← links)
• Some applications of the image space analysis to the duality theory for constrained extremum problems (Q967245) (← links)
• Duality gap of the conic convex constrained optimization problems in normed spaces (Q1013974) (← links)
• Generalizations of Slater's constraint qualification for infinite convex programs (Q1198330) (← links)
• Infinite-dimensional convex programming with applications to constrained approximation (Q1321276) (← links)
• Semicontinuity and quasiconvex functions (Q1369052) (← links)
• Conjugate duality in set-valued vector optimization (Q1378696) (← links)
• On convex generalized systems (Q1573992) (← links)
• Stability of the duality gap in linear optimization (Q1679595) (← links)
• Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap (Q1685581) (← links)
• Ensuring privacy with constrained additive noise by minimizing Fisher information (Q1716667) (← links)
• Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs (Q1771100) (← links)
• Sequential Lagrangian conditions for convex programs with applications to semidefinite programming (Q1781864) (← links)
• Sufficient optimality conditions and duality in vector optimization with invex-convexlike functions (Q1906741) (← links)
• Invex-convexlike functions and duality (Q1906754) (← links)
• Characterizing global optimality for DC optimization problems under convex inequality constraints (Q1924070) (← links)
• Weak Fenchel and weak Fenchel-Lagrange conjugate duality for nonconvex scalar optimization problems (Q1928273) (← links)
• Stable zero Lagrange duality for DC conic programming (Q1952895) (← links)
• Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma (Q1987329) (← links)
• Min-sup-type zero duality gap properties for DC composite optimization problem (Q2067945) (← links)
• Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality (Q2273897) (← links)
• On the existence of a saddle value (Q2349839) (← links)
• Robust envelope-constrained filter with orthonormal bases and semi-definite and semi-infinite programming (Q2454635) (← links)
• A solvability theorem and minimax fractional programming (Q4031966) (← links)
• (Q4557933) (← links)
• DC approach to weakly convex optimization and nonconvex quadratic optimization problems (Q4639126) (← links)
• A solution method for combined semi-infinite and semi-definite programming (Q4831772) (← links)
• Extended Lagrange And Penalty Functions in Continuous Optimization^* (Q4943962) (← links)
• Duality for Optimization Problems with Infinite Sums (Q5231686) (← links)
• On duality gap with polynomial multipliers for polynomial optimization problems (Q5879569) (← links)
• Nonlinear Lagrangian theory for nonconvex optimization. (Q5942347) (← links)