Pages that link to "Item:Q4785903"
From MaRDI portal
The following pages link to Convergence Properties of the BFGS Algoritm (Q4785903):
Displayed 50 items.
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem (Q283997) (← links)
- Nonsmooth optimization via quasi-Newton methods (Q378113) (← links)
- Global convergence of a modified limited memory BFGS method for non-convex minimization (Q385195) (← links)
- The divergence of the BFGS and Gauss Newton methods (Q463731) (← links)
- An improved nonlinear conjugate gradient method with an optimal property (Q476750) (← links)
- A nonmonotone filter line search technique for the MBFGS method in unconstrained optimization (Q488947) (← links)
- Analysis of sparse quasi-Newton updates with positive definite matrix completion (Q489095) (← links)
- The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems (Q625664) (← links)
- On Nesterov's nonsmooth Chebyshev-Rosenbrock functions (Q654068) (← links)
- Global convergence of a modified Hestenes-Stiefel nonlinear conjugate gradient method with Armijo line search (Q662895) (← links)
- An adaptive scaled BFGS method for unconstrained optimization (Q684183) (← links)
- A nonmonotone PSB algorithm for solving unconstrained optimization (Q694601) (← links)
- Convergence analysis of a modified BFGS method on convex minimizations (Q711385) (← links)
- An inexact-restoration method for nonlinear bilevel programming problems (Q839690) (← links)
- A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems (Q897051) (← links)
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization (Q953368) (← links)
- A limited memory BFGS-type method for large-scale unconstrained optimization (Q1004767) (← links)
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization (Q1026434) (← links)
- A new backtracking inexact BFGS method for symmetric nonlinear equations (Q1031701) (← links)
- A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization (Q1670017) (← links)
- A double parameter scaled BFGS method for unconstrained optimization (Q1677470) (← links)
- A perfect example for the BFGS method (Q1949264) (← links)
- A new modified BFGS method for unconstrained optimization problems (Q1993498) (← links)
- A descent conjugate gradient algorithm for optimization problems and its applications in image restoration and compression sensing (Q2004234) (← links)
- Convergence analysis of an improved BFGS method and its application in the Muskingum model (Q2007100) (← links)
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization (Q2007164) (← links)
- The global convergence of the BFGS method under a modified Yuan-Wei-Lu line search technique (Q2181683) (← links)
- Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions (Q2189404) (← links)
- Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions (Q2190800) (← links)
- The projection technique for two open problems of unconstrained optimization problems (Q2194129) (← links)
- Conditional random field for monitoring multimode processes with stochastic perturbations (Q2198713) (← links)
- A regularized limited memory BFGS method for nonconvex unconstrained minimization (Q2248965) (← links)
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search (Q2290291) (← links)
- A conjugate gradient algorithm and its applications in image restoration (Q2301430) (← links)
- The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions (Q2315883) (← links)
- A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems (Q2332754) (← links)
- Nonsmoothness and a variable metric method (Q2346393) (← links)
- Forward-backward quasi-Newton methods for nonsmooth optimization problems (Q2364124) (← links)
- A modified nonmonotone BFGS algorithm for unconstrained optimization (Q2400759) (← links)
- The global convergence of a modified BFGS method for nonconvex functions (Q2402402) (← links)
- New line search methods for unconstrained optimization (Q2510603) (← links)
- A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization (Q2854330) (← links)
- A CLASS OF MODIFIED BFGS METHODS WITH FUNCTION VALUE INFORMATION FOR UNCONSTRAINED OPTIMIZATION (Q2873833) (← links)
- A Modified Non-Monotone BFGS Method for Non-Convex Unconstrained Optimization (Q2931168) (← links)
- A globally convergent BFGS method for nonlinear monotone equations without any merit functions (Q3055067) (← links)
- A globally convergent BFGS method for nonconvex minimization without line searches (Q3369523) (← links)
- A nonlinear conjugate gradient method based on the MBFGS secant condition (Q3423590) (← links)
- A BFGS algorithm for solving symmetric nonlinear equations (Q4916309) (← links)
- A robust multi-batch L-BFGS method for machine learning (Q4972551) (← links)
- Estimating Dynamic Treatment Regimes in Mobile Health Using V-Learning (Q5130615) (← links)