An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems.
Jörg FliegePublished in: Math. Oper. Res. (2006)
Keyphrases
- interior point methods
- convex optimization
- optimization problems
- convex programming
- convex optimization problems
- inequality constraints
- nonlinear programming
- primal dual
- linear program
- evolutionary algorithm
- linear programming
- semidefinite
- semidefinite programming
- cost function
- linear programming problems
- cutting plane method
- convex relaxation
- quadratic programming
- optimization methods
- total variation
- interior point algorithm
- objective function
- computationally intensive
- low rank
- total least squares
- convex functions
- convex sets
- missing data
- coefficient matrix