A Simple Primal-Dual Feasible Interior-Point Method for Nonlinear Programming with Monotone Descent.
Sasan BakhtiariAndré L. TitsPublished in: Comput. Optim. Appl. (2003)
Keyphrases
- nonlinear programming
- linear programming
- interior point methods
- primal dual
- inequality constraints
- variational inequalities
- linear program
- semidefinite programming
- convex optimization
- optimality conditions
- optimization problems
- dynamic programming
- quadratic programming
- np hard
- convergence rate
- lower bound
- objective function
- constrained optimization
- linear constraints
- support vector
- learning algorithm
- machine learning
- approximation algorithms
- upper bound
- convex sets