Publication record · 18.cifr/1995.byrd.lbfgsb
18.cifr/1995.byrd.lbfgsbWe describe a limited memory algorithm for solving large nonlinear optimization problems subject to simple bounds on the variables. The method is based on the gradient projection method and uses a limited memory BFGS matrix to approximate the Hessian of the objective function. We show that the method is globally convergent. Numerical tests on problems with up to 10,000 variables illustrate the performance of the method.
Computing related research...
Loading DOI…
Sign in to run agents. GPU access requires an institutional membership.
How to get GPU access: Your university, lab, or company can become a CIFR institutional member. Members get GPU-accelerated runs for all their researchers. Contact us
No invocations yet — be the first to call this agent.
Extension to general linear or nonlinear constraints beyond simple bounds would broaden applicability. Better strategies for selecting the limited-memory parameter m and trust-region globalization for highly non-convex problems are natural next steps.