A primal-dual interior point method for large-scale free material optimization.
Alemseged Gebrehiwot WeldeyesusMathias StolpePublished in: Comput. Optim. Appl. (2015)
Keyphrases
- primal dual
- interior point methods
- convex programming
- convex optimization
- linear programming
- saddle point
- quadratic programming
- convex optimization problems
- linear program
- interior point algorithm
- semidefinite programming
- linear programming problems
- interior point
- semidefinite
- convergence rate
- variational inequalities
- approximation algorithms
- inequality constraints
- convex relaxation
- nonlinear programming
- algorithm for linear programming
- simplex method
- convex functions
- linear systems
- low rank
- np hard
- multiple objectives
- optimization problems