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)
- Title not available (Why is that?)
- Mathematical optimization in intensity modulated radiation therapy
- A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results
- 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
- Block BFGS Methods
- 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
- 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 optimal parameter for Dai-Liao family of conjugate gradient methods
- An active-set projected trust region algorithm for box constrained optimization problems
- Computation of the analysis error covariance in variational data assimilation problems with nonlinear dynamics
- A constrained optimization algorithm for total energy minimization in electronic structure calculations
- Active control and drag optimization for flow past a circular cylinder. I: Oscillatory cylinder rotation
- Local optima smoothing for global optimization
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- A limited memory BFGS-type method for large-scale unconstrained optimization
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
- Scaling damped limited-memory updates for unconstrained optimization
- Dynamic scaling on the limited memory BFGS method
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- A numerical study of limited memory BFGS methods
- A combined class of self-scaling and modified quasi-Newton methods
- Title not available (Why is that?)
- A computational method for full waveform inversion of crosswell seismic data using automatic differentiation
- A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Optimal control of flow with discontinuities.
- On the resolution of monotone complementarity problems
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
- Conjugate gradient methods with Armijo-type line searches.
- An efficient multigrid strategy for large-scale molecular mechanics optimization
- A non-monotone line search algorithm for unconstrained optimization
- Spectral gradient projection method for solving nonlinear monotone equations
- An Efficient Surrogate Model for Emulation and Physics Extraction of Large Eddy Simulations
- New limited memory bundle method for large-scale nonsmooth optimization
- Comparison of Gaussian process modeling software
- A trust-region algorithm for global optimization
- A practical PR+ conjugate gradient method only using gradient
- Algorithm 943
- Title not available (Why is that?)
- A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization
- A theoretical framework of the scaled Gaussian stochastic process in prediction and calibration
- Computational experiments with scaled initial hessian approximation for the broyden family methods∗
- Pointwise control of the Burgers equation and related Nash equilibrium problems: Computational approach
- Coefficients of polynomials of restricted growth on the real line
- Optimal control of cylinder wakes via suction and blowing
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Markov logic networks
- A Globally Convergent Trust-Region Method for Large-Scale Symmetric Nonlinear Systems
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- On Efficiently Computing the Eigenvalues of Limited-Memory Quasi-Newton Matrices
- Recent advances in trust region algorithms
- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
- A new three-term conjugate gradient algorithm for unconstrained optimization
- Damped techniques for the limited memory BFGS method for large-scale optimization
- On rotation deformation zones for finite-strain Cosserat plasticity
- Limited memory BFGS method based on a high-order tensor model
- Title not available (Why is that?)
- Spectral estimation of Hawkes processes from count data
- A Two-Term PRP-Based Descent Method
- Some descent three-term conjugate gradient methods and their global convergence
- An optimal subgradient algorithm with subspace search for costly convex optimization problems
- A \(\mathcal{VU}\)-algorithm for convex minimization
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
- Semideterministic global optimization method: Application to a control problem of the Burgers equation
- Retrieving the variable coefficient for a nonlinear convection–diffusion problem with spectral conjugate gradient method
- Some numerical experiments with variable-storage quasi-Newton algorithms
- Acceleration of conjugate gradient algorithms for 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
- 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
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)
