Complexity analysis of a full-Newton step interior-point method for linear optimization.
Zsolt DarvayIngrid-Magdolna PappPetra-Renáta TakácsPublished in: Period. Math. Hung. (2016)
Keyphrases
- interior point methods
- complexity analysis
- quadratic programming
- semidefinite
- convex programming
- convex optimization
- semidefinite programming
- linear programming
- linear systems
- lower bound
- linear program
- theoretical analysis
- cutting plane method
- inequality constraints
- primal dual
- linear programming problems
- computational complexity
- solving problems
- computationally intensive
- newton method
- analytic center
- image processing
- convex relaxation
- ls svm
- first order logic
- coefficient matrix
- superlinear convergence