On the Convergence of the Variable Metric Algorithm

Cited in

(78)

The convergence of matrices generated by rank-2 methods from the restricted \(\beta\)-class of Broyden
Two examples on the convergence of certain rank-2 minimization methods for quadratic functionals in Hilbert space
Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung
On the convergence, invariance, and related aspects of a modification of Huang's algorithm
A variable metric algorithm for unconstrained minimization without evaluation of derivatives
Superlinear convergence of symmetric Huang's class of methods
On the order of convergence of certain quasi-Newton methods
Über die Konvergenz des Davidon-Fletcher-Powell-Verfahrens für streng konvexe Minimierungsaufgaben im Hilbertraum
Variable metric methods in Hilbert space with applications to control problems
Direct prediction methods in Hilbert space with applications to control problems
On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory
An algorithm for minimizing a differentiable function subject to box constraints and errors
Application of Bayesian approach to numerical methods of global and stochastic optimization
Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization
The convergence of Broyden algorithms for LC gradient function
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
Convergence property of a class of variable metric methods.
The revised DFP algorithm without exact line search
Hartley-type algebras in displacement and optimization strategies.
A perfect example for the BFGS method
Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization
Implementing and modifying Broyden class updates for large scale optimization
New results on superlinear convergence of classical quasi-Newton methods
On \(q\)-BFGS algorithm for unconstrained optimization problems
Rates of superlinear convergence for classical quasi-Newton methods
Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization
Global convergence of a modified Broyden family method for nonconvex functions
The projection technique for two open problems of unconstrained optimization problems
Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
Nonsmoothness and a variable metric method
The global convergence of a modified BFGS method for nonconvex functions
A globally convergent BFGS method for nonlinear monotone equations without any merit functions
A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION
A hybrid algorithm for finding a global minimum
The convergence of variable metric matrices in unconstrained optimization
A globally convergent BFGS method for nonconvex minimization without line searches
Mise à jour de la métrique dans les méthodes de quasi-Newton réduites en optimisation avec contraintes d'égalité
Superlinear convergence of Broyden's boundedθ-class of methods
Practical convergence conditions for the Davidon-Fletcher-Powell method
On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class
Factorized Variable Metric Methods for Unconstrained Optimization
The Affine Scale Invariance of Minimization Algorithms
A derivative-free line search and dfp method for symmetric equations with global and superlinear convergence
Nonlinear optimization of constrained functions using tabu search
A NOTE ON THE CONVERGENCE OF THE DFP ALGORITHM ON QUADRATIC UNIFORMLY CONVEX FUNCTIONS
On the foundations and the applications of evolutionary computing
A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
A numerical evaluation of some collinear scaling algorithms for unconstrained
Quasi-newton algorithms generate identical points
Quasi Newton techniques generate identical points II: The proofs of four new theorems
Greedy quasi-Newton methods with explicit superlinear convergence
A modified BFGS method and its global convergence in nonconvex minimization
Superlinear convergence of the DFP algorithm without exact line search
Convergence of the DFP algorithm without exact line search
Towards explicit superlinear convergence rate for SR1
Non-asymptotic superlinear convergence of standard quasi-Newton methods
Greedy PSB methods with explicit superlinear convergence
The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems
A modified two-parameter scaled Broyden-type algorithm for unconstrained optimization problems
Global convergence of a cautious projection BFGS algorithm for nonconvex problems without gradient Lipschitz continuity
An adaptive scaled BFGS method for unconstrained optimization
Phase-field fracture analysis: a gradient-based line search strategy for the L-BFGS algorithm
Quasi-Newton Method for Set Optimization Problems with Set-Valued Mapping Given by Finitely Many Vector-Valued Functions
A guide to stochastic optimisation for large-scale inverse problems
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
Quasi-Newton method with subspace gradients
Optimization methods for solving matrix equations
Greedy Newton: Newton's method with exact line search
Non-asymptotic global convergence rates of BFGS with exact line search
A super-linear convergent gradient projection type algorithm for linearly constrained problems
On the convergence property of the DFP algorithm
A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems
The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions
The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions
A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule
A new constructing auxiliary function method for global optimization

This page was built for publication: On the Convergence of the Variable Metric Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5621914)