Higher-order interior point methods for convex nonlinear programming.
Thomas A. EspaasVassilios S. VassiliadisPublished in: Comput. Chem. Eng. (2024)
Keyphrases
- interior point methods
- nonlinear programming
- higher order
- inequality constraints
- linear programming
- convex programming
- semidefinite programming
- convex optimization
- semidefinite
- optimality conditions
- linear program
- primal dual
- variational inequalities
- interior point
- convex sets
- high order
- natural images
- pairwise
- quadratic programming
- equality constraints
- optimization problems
- linear constraints
- markov random field
- quadratic program
- computationally intensive
- reinforcement learning
- np hard
- optimal solution
- solving problems
- mixed integer
- approximation algorithms
- total variation
- objective function