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)
- Adversarial uncertainty quantification in physics-informed neural networks
- Herd immunity levels and multi-strain influenza epidemics in Russia: a modelling study
- Hessian initialization strategies for \(\ell \)-BFGS solving non-linear inverse problems
- Variational models for signal processing with graph neural networks
- Adaptive, limited-memory BFGS algorithms for unconstrained optimization
- On efficiency of nonmonotone Armijo-type line searches
- Physics-informed neural networks: a deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations
- An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations
- Gradient-based optimization for regression in the functional tensor-train format
- Multi-step spectral gradient methods with modified weak secant relation for large scale unconstrained optimization
- A functional optimization approach to an inverse magneto-convection problem.
- Designing Efficient Evolutionary Algorithms for Cluster Optimization: A Study on Locality
- A new class of memory gradient methods with inexact line searches
- DFT-FE - a massively parallel adaptive finite-element code for large-scale density functional theory calculations
- Inexact successive quadratic approximation for regularized optimization
- A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
- Solving forward and inverse problems of the logarithmic nonlinear Schrödinger equation with \(\mathcal{PT}\)-symmetric harmonic potential via deep learning
- A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence
- Hessian-based covariance approximations in variational data assimilation
- Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
- Kernel metrics on normal cycles and application to curve matching
- Numerical minimization of Dirichlet Laplacian eigenvalues of four-dimensional geometries
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints
- Optimization methods for large-scale machine learning
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- Influence of external factors on inter-city influenza spread in Russia: a modeling approach
- Global convergence properties of the two new dependent Fletcher-Reeves conjugate gradient methods
- A fractal shape optimization problem in branched transport
- Clustering methods for large scale geometrical global optimization
- Maximum principle based algorithms for deep learning
- A new class of supermemory gradient methods
- A double parameter self-scaling memoryless BFGS method for unconstrained optimization
- A dimer-type saddle search algorithm with preconditioning and linesearch
- IMAS. Integrated modeling and analysis system for the solution of optimal control problems
- Prediction of influenza peaks in Russian cities: comparing the accuracy of two SEIR models
- Physics-informed neural networks for shell structures
- Extra multistep BFGS updates in quasi-Newton methods
- Adjoint-free calculation method for conditional nonlinear optimal perturbations
- Title not available (Why is that?)
- Computing eigenvalues of large scale sparse tensors arising from a hypergraph
- Fast reverse-mode automatic differentiation using expression templates in C++
- Comparison of different estimation procedures for proportional hazards model with random effects
- A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems
- Island models for cluster geometry optimization: how design options impact effectiveness and diversity
- Optimal low-rank approximations of Bayesian linear inverse problems
- A novel homogenization method for phase field approaches based on partial rank-one relaxation
- A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations
- Some numerical methods for the study of the convexity notions arising in the calculus of variations
- A modified non-monotone BFGS method for non-convex unconstrained optimization
- Implementing and modifying Broyden class updates for large scale optimization
- Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition
- HiDeNN-FEM: a seamless machine learning approach to nonlinear finite element analysis
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- A modified limited memory BFGS method for large-scale optimization
- On the use of neural networks for full waveform inversion
- Applications of nonlinear optimization method to numerical studies of atmospheric and oceanic sciences
- A regularized limited memory BFGS method for nonconvex unconstrained minimization
- Hidden physics models: machine learning of nonlinear partial differential equations
- An extended nonmonotone line search technique for large-scale unconstrained optimization
- The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications
- Machine learning of linear differential equations using Gaussian processes
- Semi-idealized study on estimation of partly and fully space varying open boundary conditions for tidal models
- A general distributed dual coordinate optimization framework for regularized loss minimization
- A trust region subspace method for large-scale unconstrained optimization
- Accelerated Molecular Statics Based on Atomic Inertia Effect
- Deep learning methods for partial differential equations and related parameter identification problems
- A practical method for solving large-scale TRS
- Hybrid FEM-NN models: combining artificial neural networks with the finite element method
- A hybrid ODE-based method for unconstrained optimization problems
- An atomistic-based boundary element method for the reduction of molecular statics models
- Observation targeting with a second-order adjoint method for increased predictability
- Extra-updates criterion for the limited memory BFGS algorithm for large scale nonlinear optimization
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
- An active set strategy based on the multiplier function or the gradient.
- A new supermemory gradient method for unconstrained optimization problems
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
- Numerical Experience with Limited-Memory Quasi-Newton and Truncated Newton Methods
- An active set quasi-Newton method with projected search for bound constrained minimization
- Iterated dynamic neighborhood search for packing equal circles on a sphere
- Inferring solutions of differential equations using noisy multi-fidelity data
- Shifted limited-memory variable metric methods for large-scale unconstrained optimization
- A conjugate directions approach to improve the limited-memory BFGS method
- On efficiently combining limited-memory and trust-region techniques
- On the performance of switching BFGS/SR1 algorithms for unconstrained optimization
- Solving inverse problems involving the Navier--Stokes equations discretized by a Lagrange--Galerkin method
- Open-loop optimal control of a flapping wing using an adjoint lattice Boltzmann method
- Improved Hessian approximations for the limited memory BFGS method
- An optimization approach to the problem of protein structure prediction
- An iterative global optimization algorithm for potential energy minimization
- A limited-memory Riemannian symmetric rank-one trust-region method with a restart strategy
- POSTURE INVARIANT CORRESPONDENCE OF INCOMPLETE TRIANGULAR MANIFOLDS
- A modified limited-memory BNS method for unconstrained minimization based on the conjugate directions idea
- Free energy calculations by molecular simulations of deformed polymer glasses
- Composing scalable nonlinear algebraic solvers
- Iterated dynamic thresholding search for packing equal circles into a circular container
- Identification of dipole sources in an elliptic equation from boundary measurements: application to the inverse EEG problem
- An incomplete Hessian Newton minimization method and its application in a chemical database problem
- Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
- Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems
- Damped techniques for enforcing convergence of quasi-Newton methods
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)
