Interior-point methods for nonconvex nonlinear programming: cubic regularization.
Hande Y. BensonDavid F. ShannoPublished in: Comput. Optim. Appl. (2014)
Keyphrases
- nonlinear programming
- interior point methods
- linear programming
- semidefinite programming
- linear program
- primal dual
- optimality conditions
- interior point
- variational inequalities
- convex optimization
- quadratic programming
- optimization problems
- np hard
- optimal solution
- objective function
- linear constraints
- mixed integer nonlinear programming
- maximum margin
- column generation
- dynamic programming
- exact algorithms
- mixed integer
- upper bound
- reinforcement learning