Pages that link to "Item:Q3563918"

The following pages link to Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization (Q3563918):

Displaying 45 items.

• S-lemma with equality and its applications (Q263215) (← links)
• Global optimality conditions for nonconvex minimization problems with quadratic constraints (Q265137) (← 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)
• Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← 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)
• Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations (Q721169) (← links)
• A theorem of the alternative with an arbitrary number of inequalities and quadratic programming (Q1679492) (← links)
• Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization (Q1728358) (← links)
• Theorems of the alternative for inequality systems of real polynomials (Q1762405) (← links)
• Some results for quadratic problems with one or two quadratic constraints (Q1785624) (← links)
• Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty (Q1941033) (← links)
• Global error bounds for piecewise convex polynomials (Q1942267) (← links)
• Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma (Q1987329) (← links)
• A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
• Global optimality condition for quadratic optimization problems under data uncertainty (Q2045908) (← links)
• Theorems of the alternative revisited and some extensions of Yuan's lemma (Q2158842) (← links)
• A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints (Q2248753) (← links)
• Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality (Q2273897) (← links)
• A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints (Q2294373) (← links)
• Global optimality conditions for nonlinear programming problems with linear equality constraints (Q2336220) (← links)
• Narrowing the difficulty gap for the Celis-Dennis-Tapia problem (Q2349132) (← links)
• Generalized S-lemma and strong duality in nonconvex quadratic programming (Q2392110) (← links)
• Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint (Q2413092) (← links)
• Hidden conic quadratic representation of some nonconvex quadratic optimization problems (Q2436648) (← links)
• Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (Q2442635) (← links)
• Toward nonquadratic S-lemma: new theory and application in nonconvex optimization (Q2671452) (← links)
• Calabi-Polyak convexity theorem, Yuan'S lemma and S-lemma: extensions and applications (Q2689864) (← links)
• A Note on Polynomial Solvability of the CDT Problem (Q2789609) (← links)
• Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems (Q2796798) (← links)
• Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem (Q2968177) (← links)
• Global Optimality Conditions for Classes of Non-convex Multi-objective Quadratic Optimization Problems (Q2995269) (← links)
• Solving a class of non-convex quadratic problems based on generalized KKT conditions and neurodynamic optimization technique (Q3466283) (← links)
• Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems (Q4609471) (← links)
• Characterizing Convexity of Images for Quadratic-Linear Mappings with Applications in Nonconvex Quadratic Optimization (Q5003213) (← links)
• A new class of alternative theorems for SOS-convex inequalities and robust optimization (Q5175328) (← links)
• (Q5208226) (← links)
• Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200) (← links)
• Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: exact second-order cone program reformulations (Q6169993) (← links)
• On global solvability of a class of possibly nonconvex QCQP problems in Hilbert spaces (Q6648843) (← links)