An interior-point method for large constrained discrete ill-posed problems.
Serena MorigiLothar ReichelFiorella SgallariPublished in: J. Comput. Appl. Math. (2010)
Keyphrases
- interior point methods
- convex optimization
- linear program
- primal dual
- linear programming
- semidefinite programming
- quadratic programming
- inequality constraints
- interior point algorithm
- linear programming problems
- solving problems
- coefficient matrix
- computationally intensive
- dynamic programming
- linear systems
- upper bound
- multiscale
- training data