Primal-dual Newton interior point methods in shape and topology optimization.
Ronald H. W. HoppeSvetozara I. PetrovaPublished in: Numer. Linear Algebra Appl. (2004)
Keyphrases
- interior point methods
- primal dual
- convex programming
- linear programming
- convex optimization
- quadratic programming
- interior point
- convex optimization problems
- linear program
- semidefinite
- linear programming problems
- interior point algorithm
- semidefinite programming
- convergence rate
- approximation algorithms
- analytic center
- variational inequalities
- nonlinear programming
- simplex algorithm
- simplex method
- extreme points
- algorithm for linear programming
- convex relaxation
- valid inequalities
- solving problems
- optimization problems
- column generation
- computationally intensive
- image segmentation
- special case