A compact limited memory method for large scale unconstrained optimization
DOI10.1016/J.EJOR.2006.02.045zbMATH Open1114.90072OpenAlexW2071608714MaRDI QIDQ869145FDOQ869145
Authors: Cheng-Xian Xu, Yueting Yang 
Publication date: 26 February 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.02.045
Recommendations
- A limited memory BFGS-type method for large-scale unconstrained optimization
- Limited-Memory Reduced-Hessian Methods for Large-Scale Unconstrained Optimization
- A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations
- A limited memory adaptive trust-region approach for large-scale unconstrained optimization
- On the limited memory BFGS method for large scale optimization
- Shifted limited-memory variable metric methods for large-scale unconstrained optimization
- scientific article
- A modified limited memory BFGS method for large-scale optimization
- scientific article; zbMATH DE number 5630374
- LMBOPT: a limited memory method for bound-constrained optimization
nonlinear programminglarge scale optimizationBFGS updatelimited memory quasi-Newton methodmodified quasi-Newton equation
Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)
Cites Work
- Testing Unconstrained Optimization Software
- On the limited memory BFGS method for large scale optimization
- Updating Quasi-Newton Matrices with Limited Storage
- Representations of quasi-Newton matrices and their use in limited memory methods
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
- New quasi-Newton equation and related methods for unconstrained optimization
- A survey of quasi-Newton equations and quasi-Newton methods for optimization
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- Title not available (Why is that?)
- A Relationship between the BFGS and Conjugate Gradient Algorithms and Its Implications for New Algorithms
- Tensor Methods for Unconstrained Optimization Using Second Derivatives
Cited In (13)
- Compact FE for unbounded attribute-weighted sums for logspace from SXDH
- Title not available (Why is that?)
- Multiple Schubert’s updating matrix and its compact representation
- Global convergence of a modified limited memory BFGS method for non-convex minimization
- A Newton-like trust region method for large-scale unconstrained nonconvex minimization
- Shifted limited-memory variable metric methods for large-scale unconstrained optimization
- A limited memory BFGS-type method for large-scale unconstrained optimization
- A limited memory method for large scale problems
- A limited memory adaptive trust-region approach for large-scale unconstrained optimization
- Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization
- The new spectral conjugate gradient method for large-scale unconstrained optimisation
- A fast and robust unconstrained optimization method requiring minimum storage
- A regularized limited memory BFGS method for nonconvex unconstrained minimization
Uses Software
This page was built for publication: A compact limited memory method for large scale unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869145)
