A Polynomial-Time Interior-Point Method for Conic Optimization, With Inexact Barrier Evaluations.
Simon P. SchurrDianne P. O'LearyAndré L. TitsPublished in: SIAM J. Optim. (2009)
Keyphrases
- interior point methods
- quadratic programming
- convex programming
- convex optimization
- semidefinite programming
- inequality constraints
- semidefinite
- linear program
- primal dual
- linear programming
- nonlinear programming
- interior point algorithm
- computational complexity
- linear programming problems
- optimization method
- upper bound
- special case
- evolutionary algorithm