On the limited memory BFGS method for large scale optimization
From MaRDI portal
Publication:911463
DOI10.1007/BF01589116zbMATH Open0696.90048WikidataQ57311064 ScholiaQ57311064MaRDI QIDQ911463FDOQ911463
Authors: Dong C. Liu, Jorge Nocedal 
Publication date: 1989
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
- A modified limited memory BFGS method for large-scale optimization
- A limited memory BFGS-type method for large-scale unconstrained optimization
- Modifications of the limited memory BFGS algorithm for large-scale nonlinear optimization
- A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations
- A numerical study of limited memory BFGS methods
- Dynamic scaling on the limited memory BFGS method
- Damped techniques for the limited memory BFGS method for large-scale optimization
- A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization
- scientific article; zbMATH DE number 7353599
- scientific article; zbMATH DE number 1780188
large scale optimizationconvergence analysiscomputational studyconjugate gradient methodsnumerical performancecomparison of algorithmspartitioned quasi-Newton methodscaling effectssmooth unconstrained problems
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)
Cites Work
- Algorithm 630
- Partitioned variable metric updates for large structured optimization problems
- Local convergence analysis for partitioned quasi-Newton updates
- Testing Unconstrained Optimization Software
- Updating Quasi-Newton Matrices with Limited Storage
- Title not available (Why is that?)
- Restart procedures for the conjugate gradient method
- On the Convergence of a New Conjugate Gradient Algorithm
- Some numerical experiments with variable-storage quasi-Newton algorithms
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Preconditioning of Truncated-Newton Methods
- Title not available (Why is that?)
- A discrete Newton algorithm for minimizing a function of many variables
- Matrix conditioning and nonlinear optimization
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- Conjugate Gradient Methods with Inexact Searches
- Variable metric methods of minimisation
- QN-like variable storage conjugate gradients
- Title not available (Why is that?)
- A Relationship between the BFGS and Conjugate Gradient Algorithms and Its Implications for New Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- A combined conjugate-gradient quasi-Newton minimization algorithm
Cited In (only showing first 100 items - show all)
- \(n\)-step quadratic convergence of the MPRP method with a restart strategy
- Numerical expirience with a class of self-scaling quasi-Newton algorithms
- Newsvendor problems: an integrated method for estimation and optimisation
- Parallel algorithm for unconstrained optimization based on decomposition techniques
- Inflow and initial conditions for direct numerical simulation based on adjoint data assimilation
- A compact limited memory method for large scale unconstrained optimization
- Traction boundary conditions for molecular static simulations
- An Analysis of a Hybrid Optimization Method for Variational Data Assimilation
- Fast methods for computing centroidal Voronoi tessellations
- Dissimilarity measures for population-based global optimization algorithms
- A three-dimensional numerical internal tidal model involving adjoint method
- Solving large nonlinear generalized eigenvalue problems from density functional theory calculations in parallel
- Accelerated linearized Bregman method
- A unifying framework for sparsity-constrained optimization
- Dual coordinate descent methods for logistic regression and maximum entropy models
- A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties
- Limited-memory BFGS systems with diagonal updates
- Open boundary control problem for Navier-Stokes equations including a free surface: data assimilation
- Locating a nearest matrix with an eigenvalue of prespecified algebraic multiplicity
- Obtuse triangle suppression in anisotropic meshes
- Application of regularization technique to variational adjoint method: A case for nonlinear convection-diffusion problem
- Using approximate secant equations in limited memory methods for multilevel unconstrained optimization
- Shape metrics based on elastic deformations
- A dual-weighted trust-region adaptive POD 4-D var applied to a finite-volume shallow water equations model on the sphere
- An analysis of 4D variational data assimilation and its application
- A quadratic assignment formulation of the molecular conformation problem
- Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization
- Title not available (Why is that?)
- Concurrently coupled atomistic and XFEM models for dislocations and cracks
- A method for inversion of periodic open boundary conditions in two-dimensional tidal models
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- The non-convex sparse problem with nonnegative constraint for signal reconstruction
- An action-space-based global optimization algorithm for packing circles into a square container
- A non-monotone line search algorithm for unconstrained optimization
- A scalable approach for variational data assimilation
- The analysis of an ill-posed problem using multi-scale resolution and second-order adjoint techniques
- A trust-region algorithm for global optimization
- Eigenvalues and switching algorithms for Quasi-Newton updates
- Fitting the SEIR model of seasonal influenza outbreak to the incidence data for Russian cities
- Techniques for gradient-based bilevel optimization with non-smooth lower level problems
- Greedy vacancy search algorithm for packing equal circles in a square
- A continuation/GMRES method for fast computation of nonlinear receding horizon control
- Mathematical optimization in intensity modulated radiation therapy
- A population-based approach for hard global optimization problems based on dissimilarity measures
- A Barzilai-Borwein conjugate gradient method
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- Robust untangling of curvilinear meshes
- Extra updates for the bfgs method∗
- Optical tomography reconstruction algorithm with the finite element method: an optimal approach with regularization tools
- PDE-constrained optimization with error estimation and control
- Space-time adaptive solution of inverse problems with the discrete adjoint method
- A variational formulation for finite deformation wrinkling analysis of inelastic membranes
- A new nonmonotone line search technique for unconstrained optimization
- Variable metric methods for unconstrained optimization and nonlinear least squares
- Limited-Memory Reduced-Hessian Methods for Large-Scale Unconstrained Optimization
- The structure of atomic and molecular clusters, optimised using classical potentials
- Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
- An extended finite element method for dislocations in complex geometries: thin films and nanotubes
- Mechanical properties and deformation morphologies of covalently bridged multi-walled carbon nanotubes: multiscale modeling
- Variationally consistent modeling of finite strain plasticity theory with nonlinear kinematic hardening
- Discrete second order adjoints in atmospheric chemical transport modeling
- Family of projected descent methods for optimization problems with simple bounds
- Estimation of spatially varying open boundary conditions for a numerical internal tidal model with adjoint method
- Inversion of three-dimensional tidal currents in marginal seas by assimilating satellite altimetry
- Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization
- An efficient three-dimensional adaptive quasicontinuum method using variable-node elements
- Optimal reduced space for variational data assimilation
- A robust implementation of a sequential quadratic programming algorithm with successive error restoration
- Sufficient descent nonlinear conjugate gradient methods with conjugacy condition
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
- New BFGS method for unconstrained optimization problem based on modified armijo line search
- Investigation of the sampling performance of ensemble-based methods with a simple reservoir model
- Title not available (Why is that?)
- Mathematical optimization in intensity modulated radiation therapy
- A computational method to estimate the unknown coefficient in a wave equation using boundary measurements
- Physics-informed neural network simulation of multiphase poroelasticity using stress-split sequential training
- Remark on ``Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization
- Minimizing a sum of clipped convex functions
- A limited memory quasi-Newton trust-region method for box constrained optimization
- Quasi-Newton methods based on ordinary differential equation approach for unconstrained nonlinear optimization
- Identification of Manning's roughness coefficients in channel network using adjoint analysis
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization
- Subspace methods for large scale nonlinear equations and nonlinear least squares
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Large-scale Kalman filtering using the limited memory BFGS method
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- A hybrid random field model for scalable statistical learning
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem
- Lifted generative learning of Markov logic networks
- Semi-parametric estimation of multivariate extreme expectiles
- Fitting very large sparse Gaussian graphical models
- Global convergence of a modified limited memory BFGS method for non-convex minimization
- Scaled memoryless symmetric rank one method for large-scale optimization
- Sparse reconstruction for bioluminescence tomography based on the semigreedy method
- A dwindling filter line search method for unconstrained optimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- An efficient surrogate model for emulation and physics extraction of large eddy simulations
- An optimal parameter for Dai-Liao family of conjugate gradient methods
- An active-set projected trust region algorithm for box constrained optimization problems
Uses Software
This page was built for publication: On the limited memory BFGS method for large scale optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911463)
