Login / Signup

A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds.

Philipp HungerländerFranz Rendl
Published in: SIAM J. Optim. (2015)
Keyphrases
  • objective function
  • pairwise
  • dynamic programming
  • optimization problems
  • lower bound
  • efficient implementation
  • higher dimensional
  • newton method
  • active set