Convergence Properties of the BFGS Algoritm
From MaRDI portal
Recommendations
- A general convergence result for the BFGS method
- A perfect example for the BFGS method
- The global convergence of a modified BFGS method for nonconvex functions
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
Cited in
(only showing first 100 items - show all)- A limited memory BFGS-type method for large-scale unconstrained optimization
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization
- A new backtracking inexact BFGS method for symmetric nonlinear equations
- A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization
- A double parameter scaled BFGS method for unconstrained optimization
- A perfect example for the BFGS method
- A new modified BFGS method for unconstrained optimization problems
- A descent conjugate gradient algorithm for optimization problems and its applications in image restoration and compression sensing
- Convergence analysis of an improved BFGS method and its application in the Muskingum model
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization
- Using nonlinear functions to approximate a new quasi-Newton method for unconstrained optimization problems
- The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique
- A globally convergent BFGS method for symmetric nonlinear equations
- Globally convergent Newton-type methods for multiobjective optimization
- A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions
- A combined principal component analysis and energy minimization-based approach to model deformation of web core beams
- Augmented Lagrangian approach for a bilateral free boundary problem
- On \(q\)-BFGS algorithm for unconstrained optimization problems
- A quasi-Newton method with Wolfe line searches for multiobjective optimization
- Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions
- The global convergence of the BFGS method with a modified WWP line search for nonconvex functions
- Global convergence of a modified Broyden family method for nonconvex functions
- The global convergence of the BFGS method under a modified Yuan-Wei-Lu line search technique
- Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
- Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions
- The projection technique for two open problems of unconstrained optimization problems
- Conditional random field for monitoring multimode processes with stochastic perturbations
- Using gradient directions to get global convergence of Newton-type methods
- A regularized limited memory BFGS method for nonconvex unconstrained minimization
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- A conjugate gradient algorithm and its applications in image restoration
- The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
- A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems
- Nonsmoothness and a variable metric method
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- On the divergence of line search methods
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- The global convergence of a modified BFGS method for nonconvex functions
- New line search methods for unconstrained optimization
- Small collaboration: Advanced numerical methods for nonlinear hyperbolic balance laws and their applications. Abstracts from the small collaboration held August 29 -- September 4, 2021 (hybrid meeting)
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem
- A modified Hestenes-Stiefel conjugate gradient algorithm for large-scale optimization
- A class of modified BFGS methods with function value information for unconstrained optimization
- A modified non-monotone BFGS method for non-convex unconstrained optimization
- A globally convergent BFGS method for nonlinear monotone equations without any merit functions
- A globally convergent BFGS method for nonconvex minimization without line searches
- A nonlinear conjugate gradient method based on the MBFGS secant condition
- How bad are the BFGS and DFP methods when the objective function is quadratic?
- Nonsmooth optimization via quasi-Newton methods
- Global convergence of a modified limited memory BFGS method for non-convex minimization
- The divergence of the BFGS and Gauss Newton methods
- Nonsmooth variants of Powell's BFGS convergence theorem
- An improved nonlinear conjugate gradient method with an optimal property
- A nonmonotone filter line search technique for the MBFGS method in unconstrained optimization
- Analysis of sparse quasi-Newton updates with positive definite matrix completion
- A BFGS algorithm for solving symmetric nonlinear equations
- A robust multi-batch L-BFGS method for machine learning
- Quasi-Newton methods for machine learning: forget the past, just sample
- Estimating dynamic treatment regimes in mobile health using V-learning
- Using a modied secant equation for unconstrained optimization
- Lipschitz stability estimate and reconstruction of Lamé parameters in linear elasticity
- New BFGS method for unconstrained optimization problem based on modified armijo line search
- A general convergence result for the BFGS method
- A modified conjugate gradient method based on a modified secant equation
- Extended artificial neural networks approach for solving two-dimensional fractional-order Volterra-type integro-differential equations
- Adaptive Importance Sampling Based on Fault Tree Analysis for Piecewise Deterministic Markov Process
- A robust BFGS algorithm for unconstrained nonlinear optimization problems
- Competitive secant (BFGS) methods based on modified secant relations for unconstrained optimization
- Globally convergent conjugate gradient algorithms without the Lipschitz condition for nonconvex optimization
- Greedy PSB methods with explicit superlinear convergence
- On pseudoinverse-free block maximum residual nonlinear Kaczmarz method for solving large-scale nonlinear system of equations
- Truncated Newton method based on MINRES-QLP for full waveform inversion
- The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems
- A new conjugate gradient method for acceleration of gradient descent algorithms
- Global convergence of three-term conjugate gradient methods on general functions under a new inexact line search strategy
- On Nesterov's nonsmooth Chebyshev-Rosenbrock functions
- An optimisation-based domain-decomposition reduced order model for parameter-dependent non-stationary fluid dynamics problems
- Variable selection in function-on-scalar single-index model via the alternating direction method of multipliers
- Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
- Global convergence of a cautious projection BFGS algorithm for nonconvex problems without gradient Lipschitz continuity
- On the inversion-free Newton's method and its applications
- An \(LDL^{\mathrm{T}}\) trust-region quasi-Newton method
- Marginal analysis of current status data with informative cluster size using a class of semiparametric transformation cure models
- Global convergence of a modified Hestenes-Stiefel nonlinear conjugate gradient method with Armijo line search
- An adaptive scaled BFGS method for unconstrained optimization
- A deep neural network framework for solving forward and inverse problems in delay differential equations
- A unified framework for solving ill-posed problems using regularized conjugate gradient, Broyden-Fletcher-Goldfarb-Shanno (BFGS), and limited-memory BFGS
- Operator-based graph linear canonical transform
- A nonmonotone PSB algorithm for solving unconstrained optimization
- Functional time transformation model with applications to digital health
- Quasi-Newton Method for Set Optimization Problems with Set-Valued Mapping Given by Finitely Many Vector-Valued Functions
- A new scaled BFGS method for convex constraints monotone systems: applications in motion control
- Analysis of a new BFGS algorithm and conjugate gradient algorithms and their applications in image restoration and machine learning
- Convergence analysis of a modified BFGS method on convex minimizations
- Higher-order adaptive BFGS algorithm for nonconvex functions
- A novel class of spectral conjugate gradient methods for unconstrained multiobjective optimization with practical application in image processing
- Technical results on the convergence of quasi-Newton methods for nonsmooth optimization
- Modified BFGS algorithm with particular descent condition for nonconvex functions
- An inexact-restoration method for nonlinear bilevel programming problems
- A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems
This page was built for publication: Convergence Properties of the BFGS Algoritm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785903)
