The following pages link to Quadratic programming is in NP (Q2640441):
Displayed 12 items.
- On the complexity of computing the handicap of a sufficient matrix (Q644911) (← links)
- Solving optimization problems on ranks and inertias of some constrained nonlinear matrix functions via an algebraic linearization method (Q651143) (← links)
- Issues in computing contact forces for non-penetrating rigid bodies (Q686750) (← links)
- Approximation algorithms for indefinite quadratic programming (Q687094) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- The computational complexity of evolutionarily stable strategies (Q926196) (← links)
- Quadratic programming with one negative eigenvalue is NP-hard (Q1177910) (← links)
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065) (← links)
- The complexity of approximating a nonlinear program (Q1906280) (← links)
- Approximation of the quadratic set covering problem (Q2427697) (← links)
- Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization (Q3565467) (← links)
- On the parallel approximability of a subclass of quadratic programming. (Q5941277) (← links)