On the limited memory BFGS method for large scale optimization
From MaRDI portal
(Redirected from Publication:911463)
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
Cites work
- scientific article; zbMATH DE number 3843081 (Why is no real title available?)
- scientific article; zbMATH DE number 4012327 (Why is no real title available?)
- scientific article; zbMATH DE number 3687182 (Why is no real title available?)
- scientific article; zbMATH DE number 3725604 (Why is no real title available?)
- scientific article; zbMATH DE number 3529352 (Why is no real title available?)
- A Relationship between the BFGS and Conjugate Gradient Algorithms and Its Implications for New Algorithms
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- A combined conjugate-gradient quasi-Newton minimization algorithm
- A discrete Newton algorithm for minimizing a function of many variables
- Algorithm 630
- Conjugate Gradient Methods with Inexact Searches
- Local convergence analysis for partitioned quasi-Newton updates
- Matrix conditioning and nonlinear optimization
- On the Convergence of a New Conjugate Gradient Algorithm
- Partitioned variable metric updates for large structured optimization problems
- Preconditioning of Truncated-Newton Methods
- QN-like variable storage conjugate gradients
- Restart procedures for the conjugate gradient method
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- Some numerical experiments with variable-storage quasi-Newton algorithms
- Testing Unconstrained Optimization Software
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Updating Quasi-Newton Matrices with Limited Storage
- Variable metric methods of minimisation
Cited in
(only showing first 100 items - show all)- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- Markov logic networks
- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
- scientific article; zbMATH DE number 7370606 (Why is no real title available?)
- Global convergence of a modified limited memory BFGS method for non-convex minimization
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- A limited memory quasi-Newton trust-region method for box constrained optimization
- Computational experiments with scaled initial hessian approximation for the broyden family methods∗
- Global convergence of online limited memory BFGS
- Damped techniques for the limited memory BFGS method for large-scale optimization
- Quasi-Newton methods based on ordinary differential equation approach for unconstrained nonlinear optimization
- Block BFGS methods
- Coefficients of polynomials of restricted growth on the real line
- A limited memory BFGS-type method for large-scale unconstrained optimization
- Semideterministic global optimization method: Application to a control problem of the Burgers equation
- scientific article; zbMATH DE number 778130 (Why is no real title available?)
- An efficient surrogate model for emulation and physics extraction of large eddy simulations
- A hybrid random field model for scalable statistical learning
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
- An optimal parameter for Dai-Liao family of conjugate gradient methods
- Spectral estimation of Hawkes processes from count data
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem
- Optimal control of flow with discontinuities.
- On the resolution of monotone complementarity problems
- Lifted generative learning of Markov logic networks
- A Globally Convergent Trust-Region Method for Large-Scale Symmetric Nonlinear Systems
- A theoretical framework of the scaled Gaussian stochastic process in prediction and calibration
- Semi-parametric estimation of multivariate extreme expectiles
- scientific article; zbMATH DE number 7415109 (Why is no real title available?)
- Optimal control of cylinder wakes via suction and blowing
- Recent advances in trust region algorithms
- Physics-informed neural network simulation of multiphase poroelasticity using stress-split sequential training
- Active control and drag optimization for flow past a circular cylinder. I: Oscillatory cylinder rotation
- An efficient multigrid strategy for large-scale molecular mechanics optimization
- Scaled memoryless symmetric rank one method for large-scale 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
- A numerical study of limited memory BFGS methods
- Comparison of Gaussian process modeling software
- Remark on ``Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- A constrained optimization algorithm for total energy minimization in electronic structure calculations
- Sparse reconstruction for bioluminescence tomography based on the semigreedy method
- A Two-Term PRP-Based Descent Method
- Local optima smoothing for global optimization
- Some descent three-term conjugate gradient methods and their global convergence
- An optimal subgradient algorithm with subspace search for costly convex optimization problems
- Algorithm 943: MSS: MATLAB software for L-BFGS trust-region subproblems for large-scale optimization
- Mathematical optimization in intensity modulated radiation therapy
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- On efficiently computing the eigenvalues of limited-memory quasi-Newton matrices
- Scaling damped limited-memory updates for unconstrained optimization
- Large-scale Kalman filtering using the limited memory BFGS method
- Retrieving the variable coefficient for a nonlinear convection-diffusion problem with spectral conjugate gradient method
- A computational method for full waveform inversion of crosswell seismic data using automatic differentiation
- Subspace methods for large scale nonlinear equations and nonlinear least squares
- An active-set projected trust region algorithm for box constrained optimization problems
- Spectral gradient projection method for solving nonlinear monotone equations
- Fitting very large sparse Gaussian graphical models
- A combined class of self-scaling and modified quasi-Newton methods
- Dynamic scaling on the limited memory BFGS method
- A \(\mathcal{VU}\)-algorithm for convex minimization
- A practical PR+ conjugate gradient method only using gradient
- Some numerical experiments with variable-storage quasi-Newton algorithms
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
- On rotation deformation zones for finite-strain Cosserat plasticity
- Conjugate gradient methods with Armijo-type line searches.
- A nonmonotone filter SQP method: local convergence and numerical results
- A dwindling filter line search method for unconstrained optimization
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- Minimizing a sum of clipped convex functions
- Representations of quasi-Newton matrices and their use in limited memory methods
- Limited memory BFGS method based on a high-order tensor model
- Pointwise control of the Burgers equation and related Nash equilibrium problems: Computational approach
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- A computational method to estimate the unknown coefficient in a wave equation using boundary measurements
- Computation of the analysis error covariance in variational data assimilation problems with nonlinear dynamics
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- A new three-term conjugate gradient algorithm for unconstrained optimization
- A new nonmonotone line search technique for unconstrained optimization
- A three-dimensional numerical internal tidal model involving adjoint method
- New BFGS method for unconstrained optimization problem based on modified armijo line search
- Solving large nonlinear generalized eigenvalue problems from density functional theory calculations in parallel
- Family of projected descent methods for optimization problems with simple bounds
- A Barzilai-Borwein conjugate gradient method
- A continuation/GMRES method for fast computation of nonlinear receding horizon control
- A scalable approach for variational data assimilation
- Estimation of spatially varying open boundary conditions for a numerical internal tidal model with adjoint method
- The analysis of an ill-posed problem using multi-scale resolution and second-order adjoint techniques
- 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
- Robust untangling of curvilinear meshes
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- Locating a nearest matrix with an eigenvalue of prespecified algebraic multiplicity
- Investigation of the sampling performance of ensemble-based methods with a simple reservoir model
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)
