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