Algorithm 778: L-BFGS-B
From MaRDI portal
Publication:4223464
DOI10.1145/279232.279236zbMATH Open0912.65057DBLPjournals/toms/ZhuBLN97OpenAlexW2005126631WikidataQ56572747 ScholiaQ56572747MaRDI QIDQ4223464FDOQ4223464
Authors: Ciyou Zhu, R. H. Byrd, Peihuang Lu, Jorge Nocedal 
Publication date: 3 May 1999
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1997-23/
Recommendations
- Remark on ``Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization
- Algorithm 774
- Algorithm 809: PREQN
- A class of LBFGS-type algorithms for large-scale unconstrained optimization
- Algorithm 734: A Fortran 90 code for unconstrained nonlinear minimization
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- Certification of algorithm 734
large scale optimizationvariable metric methodlarge nonlinear optimization problemslimited-memory algorithm
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cited In (only showing first 100 items - show all)
- Reconstruction of a space-dependent coefficient in a linear Benjamin-Bona-Mahony type equation
- Stochastic variational hierarchical mixture of sparse Gaussian processes for regression
- A greedy algorithm for optimal heating in powder-bed-based additive manufacturing
- Solving Fokker-Planck equation using deep learning
- Impact of force function formulations on the numerical simulation of centre-based models
- Costlets: A generalized approach to cost functions for automated optimization of IMRT treatment plans
- An efficient approach based on the gradient definition for solving conditional nonlinear optimal perturbation
- HLRF-BFGS-based algorithm for inverse reliability analysis
- Identification of the anti-diffusion coefficient for the linear Kuramoto-Sivashinsky equation
- On improving the numerical convergence of highly nonlinear elasticity problems
- Improved model-based clustering performance using Bayesian initialization averaging
- A Unified Efficient Implementation of Trust-region Type Algorithms for Unconstrained Optimization
- TeLEx: learning signal temporal logic from positive examples using tightness metric
- Bias-reduced marginal Akaike information criteria based on a Monte Carlo method for linear mixed-effects models
- Fatigue-based topology optimization with non-proportional loads
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization
- An accelerated communication-efficient primal-dual optimization framework for structured machine learning
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints
- Optimization methods for large-scale machine learning
- A coordinate-descent primal-dual algorithm with large step size and possibly nonseparable functions
- A fully discrete adjoint method for optimization of flow problems on deforming domains with time-periodicity constraints
- A plastic nonlocal damage model
- The statistical finite element method (statFEM) for coherent synthesis of observation data and model predictions
- Scaled projected-directions methods with application to transmission tomography
- Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization
- The application of a unified Bayesian stopping criterion in competing parallel algorithms for global optimization
- A solver for nonconvex bound-constrained quadratic optimization
- A domain-reduction approach to bridging-scale simulation of one-dimensional nanostructures
- History matching through a smooth formulation of multiple-point statistics
- Goal-oriented optimal design of experiments for large-scale Bayesian linear inverse problems
- Compact representations of structured BFGS matrices
- Evaluation of the docking algorithm based on tensor train global optimization
- Efficient methods for estimating constrained parameters with applications to regularized (Lasso) logistic regression
- An adaptive multipoint formulation for robust parametric optimization
- On quasi-Newton forward-backward splitting: proximal calculus and convergence
- A transition model for analyzing multivariate longitudinal data using Gaussian copula approach
- A multiscale method for distributed parameter estimation with application to reservoir history matching
- Low-rank approximations for computing observation impact in 4D-Var data assimilation
- A concept for the evolution of relational probabilistic belief states and the computation of their changes under optimum entropy semantics
- Algorithm 711: BTN: software for parallel unconstrained optimization
- Mathematical modeling of the proliferation gradient in multicellular tumor spheroids
- A joint Gaussian process model for active visual recognition with expertise estimation in crowdsourcing
- Efficient semidefinite branch-and-cut for MAP-MRF inference
- A scalable algorithm for MAP estimators in Bayesian inverse problems with Besov priors
- Latent map Gaussian processes for mixed variable metamodeling
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- Bayesian Optimization with Expensive Integrands
- A dense initialization for limited-memory quasi-Newton methods
- Evaluating bound-constrained minimization software
- An adjoint method for a high-order discretization of deforming domain conservation laws for optimization of flow problems
- Title not available (Why is that?)
- Towards a parallel component in a GPU-CUDA environment: a case study with the L-BFGS Harwell routine
- Data assimilation methods for neuronal state and parameter estimation
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- pyvine: the Python package for regular vine copula modeling, sampling and testing
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints
- Optimizing subsurface field data acquisition using information theory
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- Hybrid FEM-NN models: combining artificial neural networks with the finite element method
- Remark on ``Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Efficient and accurate rotation of finite spherical harmonics expansions
- A hybrid algorithm for solving inverse problems in elasticity
- Power system parameters forecasting using Hilbert-Huang transform and machine learning
- Minimum Lq‐distance estimators for non‐normalized parametric models
- An active set limited memory BFGS algorithm for bound constrained optimization
- Forecasting nonstationary time series based on Hilbert-Huang transform and machine learning
- A dual-weighted trust-region adaptive POD 4-D var applied to a finite-volume shallow water equations model on the sphere
- Closed-loop reservoir management on the Brugge test case
- Machine learning for global optimization
- Various methods of optimizing control pulses for quantum systems with decoherence
- Bayesian comparison of stochastic models of dispersion
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- Predicting air quality: Improvements through advanced methods to integrate models and measurements
- Solving inverse problems involving the Navier--Stokes equations discretized by a Lagrange--Galerkin method
- Large scale parameter estimation problems in frequency-domain elastodynamics using an error in constitutive equation functional
- Efficient parameter learning of Bayesian network classifiers
- Open-loop optimal control of a flapping wing using an adjoint lattice Boltzmann method
- The optimal control of unsteady flows with a discrete adjoint method
- Smoothed penalty algorithms for optimization of nonlinear models
- Probabilistic models of \(k\)-mer frequencies (extended abstract)
- A dynamic convexized method for nonconvex mixed integer nonlinear programming
- Globally convergent DC trust-region methods
- Fully corrective boosting with arbitrary loss and regularization
- On the variational data assimilation problem solving and sensitivity analysis
- A mountain pass algorithm with projector
- Extensions of classical multidimensional scaling via variable reduction
- L-BFGS
- LBFGS-B
- Algorithm 774
- A scalable approach for variational data assimilation
- Forward and adjoint sensitivity analysis with continuous explicit Runge-Kutta schemes
- Symplectic Gaussian process regression of maps in Hamiltonian systems
- A comparison of collapsed Bayesian methods for probabilistic finite automata
- Modified active set projected spectral gradient method for bound constrained optimization
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
- iNEOS: An interactive environment for nonlinear optimization
- An optimization framework to improve 4D-Var data assimilation system performance
- Markov logic networks
Uses Software
This page was built for publication: Algorithm 778: L-BFGS-B
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4223464)
