Path-following primal-dual interior-point methods for shape optimization of stationary flow problems.
Harbir AntilRonald H. W. HoppeChristopher LinsenmannPublished in: J. Num. Math. (2007)
Keyphrases
- primal dual
- interior point methods
- interior point
- convex programming
- semidefinite programming
- convex optimization problems
- saddle point
- convex optimization
- linear programming
- linear programming problems
- semidefinite
- linear program
- variational inequalities
- quadratic programming
- interior point algorithm
- solving problems
- simplex algorithm
- quadratically constrained quadratic
- approximation algorithms
- convergence rate
- convex relaxation
- algorithm for linear programming
- optimization problems
- quadratic program
- extreme points
- simplex method
- linear systems
- nonnegative matrix factorization
- multiple objectives
- analytic center
- column generation
- total variation
- multicriteria optimization