Pages that link to "Item:Q2515041"

The following pages link to The trust region subproblem with non-intersecting linear constraints (Q2515041):

Displaying 44 items.

• Trust region subproblem with an additional linear inequality constraint (Q276335) (← links)
• Exactness conditions for an SDP relaxation of the extended trust region problem (Q315474) (← links)
• Quadratic optimization with two ball constraints (Q779620) (← links)
• A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality (Q1655381) (← links)
• An efficient algorithm for solving the generalized trust region subproblem (Q1655384) (← links)
• Quadratic programs with hollows (Q1659682) (← links)
• A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints (Q1679484) (← links)
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
• Coderivatives related to parametric extended trust region subproblem and their applications (Q1990393) (← links)
• Parametric approach for solving quadratic fractional optimization with a linear and a quadratic constraint (Q2013617) (← links)
• An efficient algorithm for the extended trust-region subproblem with two linear constraints (Q2119320) (← links)
• On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
• Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem (Q2165873) (← links)
• A survey of hidden convex optimization (Q2176821) (← links)
• Finding second-order stationary points in constrained minimization: a feasible direction approach (Q2194125) (← links)
• Globally solving extended trust region subproblems with two intersecting cuts (Q2228371) (← links)
• A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (Q2244199) (← links)
• Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
• A hybrid algorithm for the two-trust-region subproblem (Q2322760) (← links)
• A gentle, geometric introduction to copositive optimization (Q2349118) (← links)
• A necessary and sufficient condition of convexity for SOC reformulation of trust-region subproblem with two intersecting cuts (Q2628919) (← links)
• On globally solving the extended trust-region subproblems (Q2661497) (← links)
• Interplay of non-convex quadratically constrained problems with adjustable robust optimization (Q2661757) (← links)
• On indefinite quadratic optimization over the intersection of balls and linear constraints (Q2671444) (← links)
• Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow (Q2689820) (← links)
• A Note on Polynomial Solvability of the CDT Problem (Q2789609) (← links)
• A Two-Variable Approach to the Two-Trust-Region Subproblem (Q2796795) (← links)
• Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems (Q4609471) (← links)
• A Block Lanczos Method for the Extended Trust-Region Subproblem (Q4629333) (← links)
• On Convex Hulls of Epigraphs of QCQPs (Q5041762) (← links)
• On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations (Q5072594) (← links)
• Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem (Q5116545) (← links)
• The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
• On Conic Relaxations of Generalization of the Extended Trust Region Subproblem (Q5214417) (← links)
• Connectivity of Quadratic Hypersurfaces and Its Applications in Optimization, Part I: General Theory (Q5254997) (← links)
• A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants (Q5348458) (← links)
• New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem (Q5737733) (← links)
• A Linear-Time Algorithm for Generalized Trust Region Subproblems (Q5853724) (← links)
• KKT-based primal-dual exactness conditions for the Shor relaxation (Q6104908) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)
• Convex hull results on quadratic programs with non-intersecting constraints (Q6126659) (← links)
• Semidefinite representable reformulations for two variants of the trust-region subproblem (Q6556206) (← links)
• New results on eliminating the duality gap of the second-order-cone reformulation for extended trust-region subproblem with two intersecting cuts (Q6639477) (← links)
• Accelerated first-order methods for a class of semidefinite programs (Q6665390) (← links)