Pages that link to "Item:Q374638"

The following pages link to Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization (Q374638):

Displaying 23 items.

• S-lemma with equality and its applications (Q263215) (← links)
• A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure (Q274079) (← links)
• Robust canonical duality theory for solving nonconvex programming problems under data uncertainty (Q328533) (← links)
• Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming (Q378284) (← links)
• Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition (Q415403) (← links)
• A complete characterization of strong duality in nonconvex optimization with a single constraint (Q454276) (← links)
• Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems (Q620513) (← links)
• A note on nonconvex minimax theorem with separable homogeneous polynomials (Q637566) (← links)
• Robust duality for generalized convex programming problems under data uncertainty (Q654075) (← links)
• Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty (Q1941033) (← links)
• Semidefinite program duals for separable polynomial programs involving box constraints (Q1985290) (← links)
• On fractional quadratic optimization problem with two quadratic constraints (Q2061307) (← links)
• On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization (Q2216183) (← links)
• A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints (Q2248753) (← links)
• Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint (Q2413092) (← links)
• Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (Q2442635) (← links)
• Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements (Q3225066) (← links)
• Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems (Q4609471) (← links)
• On stability of solutions to parametric generalized affine variational inequalities (Q4639129) (← links)
• A new class of alternative theorems for SOS-convex inequalities and robust optimization (Q5175328) (← links)
• Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: exact second-order cone program reformulations (Q6169993) (← links)
• Quadratic program on a structured nonconvex set (Q6534586) (← links)
• Affinely adjustable robust optimization for radiation therapy under evolving data uncertainty via semi-definite programming (Q6548322) (← links)