Cited in
(16)- Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
- Fitting curves and surfaces to point clouds in the presence of obstacles
- Newton-KKT interior-point methods for indefinite quadratic programming
- Adaptive constraint reduction for convex quadratic programming
- Quadratic maximization of reachable values of affine systems with diagonalizable matrix
- reducedLP
- MINQ
- An Interior‐Point Trust‐Region Algorithm for General Symmetric Cone Programming
- Constraint Reduction for Linear Programs with Many Inequality Constraints
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming
- LADEL
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Nonlinear optimization problem of interdependent investment projects portfolio
- MINQ8: general definite and bound constrained indefinite quadratic programming
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
- MINQ8
This page was built for software: NewtonKKTqp
