The following pages link to Quadratic programming is in NP (Q2640441):
Displaying 40 items.
- Trading performance for stability in Markov decision processes (Q340568) (← links)
- Abstract interpretation meets convex optimization (Q435969) (← links)
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization (Q496589) (← links)
- Mixed-integer quadratic programming is in NP (Q517303) (← links)
- 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)
- Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions (Q1683689) (← links)
- Abstract model repair for probabilistic systems (Q1706149) (← links)
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint (Q1717222) (← links)
- On approximation algorithms for concave mixed-integer quadratic programming (Q1800986) (← links)
- The complexity of approximating a nonlinear program (Q1906280) (← links)
- On the complexity of finding a local minimizer of a quadratic function over a polytope (Q2089789) (← links)
- Robustness to rank reversal in pairwise comparison matrices based on uncertainty bounds (Q2171613) (← links)
- A study of piecewise linear-quadratic programs (Q2194127) (← links)
- Random projections for quadratic programs (Q2196316) (← links)
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Characterizations of mixed binary convex quadratic representable sets (Q2316624) (← links)
- Facets of a mixed-integer bilinear covering set with bounds on variables (Q2423814) (← links)
- Approximation of the quadratic set covering problem (Q2427697) (← links)
- On the utility maximization of the discrepancy between a perceived and market implied risk neutral distribution (Q2672147) (← links)
- New bounds for nonconvex quadratically constrained quadratic programming (Q2689857) (← links)
- On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming (Q3186487) (← links)
- Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization (Q3565467) (← links)
- Hessian Barrier Algorithms for Linearly Constrained Optimization Problems (Q5233100) (← links)
- An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution (Q5502241) (← links)
- Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming (Q5853719) (← links)
- Complexity, exactness, and rationality in polynomial optimization (Q5918421) (← links)
- Complexity, exactness, and rationality in polynomial optimization (Q5925641) (← links)
- On the parallel approximability of a subclass of quadratic programming. (Q5941277) (← links)
- Foundations of probability-raising causality in Markov decision processes (Q6151547) (← links)
- An approximation algorithm for indefinite mixed integer quadratic programming (Q6165586) (← links)
- Invariants of SDP exactness in quadratic programming (Q6184179) (← links)
- How Do Exponential Size Solutions Arise in Semidefinite Programming? (Q6195320) (← links)
