On efficiently combining limited-memory and trust-region techniques
From MaRDI portal
Publication:2398109
DOI10.1007/s12532-016-0109-7zbMath1368.90103OpenAlexW242703491MaRDI QIDQ2398109
Oleg P. Burdakov, Spartak Zikrin, Lujin Gong, Ya-Xiang Yuan
Publication date: 15 August 2017
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-129783
unconstrained optimizationtrust-region methodslarge-scale problemseigenvalue decompositionlimited-memory methodsshape-changing norm
Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)
Related Items (17)
A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations ⋮ LMBOPT: a limited memory method for bound-constrained optimization ⋮ Efficient unconstrained black box optimization ⋮ On Efficiently Computing the Eigenvalues of Limited-Memory Quasi-Newton Matrices ⋮ On efficiently combining limited-memory and trust-region techniques ⋮ An active set trust-region method for bound-constrained optimization ⋮ A limited-memory Riemannian symmetric rank-one trust-region method with a restart strategy ⋮ Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization ⋮ A new multipoint symmetric secant method with a dense initial matrix ⋮ A limited-memory trust-region method for nonlinear optimization with many equality constraints ⋮ On solving L-SR1 trust-region subproblems ⋮ Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints ⋮ A new regularized quasi-Newton method for unconstrained optimization ⋮ A dense initialization for limited-memory quasi-Newton methods ⋮ Recent advances in trust region algorithms ⋮ Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation ⋮ Diagonal BFGS updates and applications to the limited memory BFGS method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limited-memory BFGS systems with diagonal updates
- On solving L-SR1 trust-region subproblems
- Some numerical experiments with variable-storage quasi-Newton algorithms
- On the limited memory BFGS method for large scale optimization
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- Convergence of quasi-Newton matrices generated by the symmetric rank one update
- Two new unconstrained optimization algorithms which use function and gradient values
- Representations of quasi-Newton matrices and their use in limited memory methods
- A limited-memory multipoint symmetric secant method for bound constrained optimization
- Recent advances in trust region algorithms
- On efficiently combining limited-memory and trust-region techniques
- Shifted L-BFGS systems
- On Efficiently Computing the Eigenvalues of Limited-Memory Quasi-Newton Matrices
- Methods of the secant type for systems of equations with symmetric jacobian matrix
- Computing a Trust Region Step
- Iterative Methods for Finding a Trust-region Step
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- QN-like variable storage conjugate gradients
- Updating Quasi-Newton Matrices with Limited Storage
- Line search algorithms with guaranteed sufficient decrease
- Limited-Memory Reduced-Hessian Methods for Large-Scale Unconstrained Optimization
- Trust Region Methods
- Solving the Trust-Region Subproblem using the Lanczos Method
- Reduced Storage, Quasi-Newton Trust Region Approaches to Function Optimization
- On Superlinear Convergence of Some Stable Variants of the Secant Method
- A Subspace Study on Conjugate Gradient Algorithms
- Stable versions of the secants method for solving systems of equations
- Algorithm 943
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- CUTEr and SifDec
- Convergence Conditions for Ascent Methods
- A New Algorithm for Unconstrained Optimization
- Benchmarking optimization software with performance profiles.
This page was built for publication: On efficiently combining limited-memory and trust-region techniques
