An interior point method for nonlinear optimization with a quasi-tangential subproblem.
Songqiang QiuZhongwen ChenPublished in: J. Comput. Appl. Math. (2018)
Keyphrases
- nonlinear optimization
- interior point methods
- convex optimization
- linear program
- linear programming
- dynamic programming
- quadratic programming
- starting points
- optimization method
- semidefinite programming
- primal dual
- bundle adjustment
- solving problems
- vector field
- computationally intensive
- global search
- closed form solutions
- linear systems
- structure from motion
- neural network
- multi view
- feature extraction
- machine learning
- variational inequalities
- feasible solution
- super resolution
- least squares