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 20 items.
- Exact computable representation of some second-order cone constrained quadratic programming problems (Q384217) (← links)
- Tilt stability for quadratic programs with one or two quadratic inequality constraints (Q778159) (← links)
- On the complexity of quadratic programming in real number models of computation (Q1338219) (← links)
- On the complexity of approximating a KKT point of quadratic programming (Q1380927) (← links)
- Approximating quadratic programming with bound and quadratic constraints (Q1572673) (← links)
- Some results for quadratic problems with one or two quadratic constraints (Q1785624) (← 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)
- A polynomial case of the cardinality-constrained quadratic optimization problem (Q2393087) (← links)
- A polynomially solvable class of two-level nonlinear programming problems (Q2713938) (← links)
- A note on polynomial solvability of the CDT problem (Q2789609) (← links)
- Solving generalized CDT problems via two-parameter eigenvalues (Q2817837) (← 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)
- Some Strongly Polynomially Solvable Convex Quadratic Programs with Bounded Variables (Q6161304) (← links)
- An efficient splitting algorithm for solving the CDT subproblem (Q6561567) (← links)