A numerical study of limited memory BFGS methods
From MaRDI portal
Publication:1861792
DOI10.1016/S0893-9659(01)00162-8zbMath1175.90419OpenAlexW1996525837MaRDI QIDQ1861792
Publication date: 10 March 2003
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0893-9659(01)00162-8
Numerical optimization and variational techniques (65K10) Methods of successive quadratic programming type (90C55)
Related Items (14)
On the numerical performance of finite-difference-based methods for derivative-free optimization ⋮ A computational method for full waveform inversion of crosswell seismic data using automatic differentiation ⋮ Primal and dual active-set methods for convex quadratic programming ⋮ Limited-memory BFGS with displacement aggregation ⋮ A penalty-interior-point algorithm for nonlinear constrained optimization ⋮ A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer ⋮ An interior point method for nonlinear programming with infeasibility detection capabilities ⋮ Limited-memory BFGS systems with diagonal updates ⋮ Discrete second order adjoints in atmospheric chemical transport modeling ⋮ A regularized limited memory BFGS method for nonconvex unconstrained minimization ⋮ A new class of memory gradient methods with inexact line searches ⋮ A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization ⋮ Adaptive augmented Lagrangian methods: algorithms and practical numerical experience ⋮ Active-set prediction for interior point methods using controlled perturbations
Uses Software
Cites Work
This page was built for publication: A numerical study of limited memory BFGS methods
