Optimizing Costly Functions with Simple Constraints: A Limited-Memory Projected Quasi-Newton Algorithm


An optimization algorithm for minimizing a smooth function over a convex set is described. Each iteration of the method computes a descent direction by minimizing, over the original constraints, a diagonal plus lowrank quadratic approximation to the function. The quadratic approximation is constructed using a limited-memory quasi-Newton update. The method… (More)
View Slides

5 Figures and Tables



Citations per Year

209 Citations

Semantic Scholar estimates that this publication has 209 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics