Pages that link to "Item:Q1717222"
From MaRDI portal
The following pages link to Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint (Q1717222):
Displayed 11 items.
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures (Q2114577) (← links)
- The generalized trust region subproblem: solution complexity and convex hull results (Q2118085) (← links)
- On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
- A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint (Q2322558) (← links)
- On Local Non-Global Minimizers of Quadratic Optimization Problem with a Single Quadratic Constraint (Q5107288) (← links)
- Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem (Q5231678) (← links)
- A Linear-Time Algorithm for Generalized Trust Region Subproblems (Q5853724) (← links)
- On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints (Q5883323) (← links)
- Positive semidefinite interval of matrix pencil and its applications to the generalized trust region subproblems (Q6087885) (← links)
- On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem (Q6092945) (← links)
- Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem (Q6114784) (← links)