Pages that link to "Item:Q2364486"
From MaRDI portal
The following pages link to On the complexity of quadratic programming with two quadratic constraints (Q2364486):
Displaying 10 items.
- Tilt stability for quadratic programs with one or two quadratic inequality constraints (Q778159) (← links)
- Efficient local search procedures for quadratic fractional programming problems (Q1986108) (← links)
- Comment on: ``Approximation algorithms for quadratic programming'' (Q2165269) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- On Chebyshev Center of the Intersection of Two Ellipsoids (Q5214416) (← links)
- On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints (Q5883323) (← links)
- KKT-based primal-dual exactness conditions for the Shor relaxation (Q6104908) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem (Q6161303) (← links)
- An efficient splitting algorithm for solving the CDT subproblem (Q6561567) (← links)
