On the limited memory BFGS method for large scale optimization
From MaRDI portal
Publication:911463
DOI10.1007/BF01589116zbMATH Open0696.90048WikidataQ57311064 ScholiaQ57311064MaRDI QIDQ911463FDOQ911463
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)
- 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
- Fast Reverse-Mode Automatic Differentiation using Expression Templates in C++
- 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
- A dimer-type saddle search algorithm with preconditioning and linesearch
- 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
- Diagonal BFGS updates and applications to the limited memory BFGS method
- Reaction-diffusion systems in protein networks: global existence and identification
- Conditional nonlinear optimal perturbation of a coupled Lorenz model
- Least-squares independence regression for non-linear causal inference under non-Gaussian noise
- Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization
- On the sufficient descent condition of the Hager-Zhang conjugate gradient methods
- A new hybrid classical-quantum algorithm for continuous global optimization problems
- Analysis of sparse quasi-Newton updates with positive definite matrix completion
- A novel variational algorithmic formulation for wrinkling at finite strains based on energy minimization: application to mesh adaption
- A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems
- A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization
- Sparse quasi-Newton updates with positive definite matrix completion
- An overview of algorithmic approaches to compute optimum entropy distributions in the expert system shell MECore (extended version)
- An approach for analyzing the global rate of convergence of quasi-Newton and truncated-Newton methods
- An adjoint-based Jacobi-type iterative method for elastic full waveform inversion problem
- Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimization
- Scaled memoryless BFGS preconditioned steepest descent method for very large-scale unconstrained optimization
- Rotational symmetry detection in 3D using reflectional symmetry candidates and quaternion-based rotation parameterization
- Compressed history matching: Exploiting transform-domain sparsity for regularization of nonlinear dynamic data integration problems
- A heuristic approach for packing identical rectangles in convex regions
- Optimal Low-rank Approximations of Bayesian Linear Inverse Problems
- An exact penalty-lagrangian approach for a class of constrained optimization problems with bounded variables
- Parabolic interface reconstruction for 2D volume of fluid methods
- Title not available (Why is that?)
- Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods
- Partitioned quasi-Newton methods for sparse nonlinear equations
- A modified conjugate gradient method based on the self-scaling memoryless BFGS update
- Optimal parameters identification and sensitivity study for abrasive waterjet milling model
- Nonlinear information fusion algorithms for data-efficient multi-fidelity modelling
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
- Diatomics-in-molecules potentials incorporating ab initio data: Application to ionic, Rydberg-excited, and molecule-doped rare gas clusters
- A family of quasi-Newton methods for unconstrained optimization problems
- Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
- How exposure to different opinions impacts the life cycle of social media
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
- On error covariances in variational data assimilation
- Kernel-based adaptive sampling for image reconstruction and meshing
- A descent hybrid conjugate gradient method based on the memoryless BFGS update
- Dyad ranking using Plackett-Luce models based on joint feature representations
- Fitting general stochastic volatility models using Laplace accelerated sequential importance sampling
- Reconstruction of recurrent synaptic connectivity of thousands of neurons from simulated spiking activity
- Accelerated nonlinear finite element method for analysis of isotropic hyperelastic materials nonlinear deformations
- A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method
- Adaptive multigrid strategy for geometry optimization of large-scale three dimensional molecular mechanics
- Inexact Hessian-vector products in reduced-space differential-equation constrained optimization
- The adjoint method for the inverse problem of option pricing
- A truncated Newton optimization algorithm in meteorology applications with analytic Hessian/vector products
- Hybrid boundary condition combined with data assimilation for simulations of free surface flows using lattice Boltzmann method
- The independent set perturbation method for efficient computation of sensitivities with applications to data assimilation and a finite element shallow water model
- Speeding up the convergence of the Polyak's heavy ball algorithm
- On the efficiency of gradient based optimization algorithms for DNS-based optimal control in a turbulent channel flow
- A linear-space algorithm for distance preserving graph embedding
- On the smoothness constraints for four-dimensional data assimilation
- A memetic algorithm to pack unequal circles into a square
- Sensitivity studies and parameters identification for noisy 3D moving AWJM model
- An adaptive meshless parameterization for full waveform inversion
- An inverse problem in elastography involving Lamé systems
- Preconditioned nonlinear conjugate gradient methods based on a modified secant equation
- HEBO: An Empirical Study of Assumptions in Bayesian Optimisation
- Re-thinking model robustness from stability: a new insight to defend adversarial examples
- A Numerical Approach to the Control and Stabilization of Advection-Diffusion Systems: Application to Viscous Drag Reduction
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Approximate ADMM algorithms derived from Lagrangian splitting
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)
