Quasi-newton algorithms generate identical points
From MaRDI portal
Publication:5657609
DOI10.1007/BF01584554zbMath0245.65029MaRDI QIDQ5657609
Publication date: 1972
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items (30)
Factorized Variable Metric Methods for Unconstrained Optimization ⋮ The symmetric rank-one quasi-Newton method is a space-dilation subgradient algorithm ⋮ The least prior deviation quasi-Newton update ⋮ Rates of superlinear convergence for classical quasi-Newton methods ⋮ On Efficiently Computing the Eigenvalues of Limited-Memory Quasi-Newton Matrices ⋮ A Note on Properties of Iterative Procedures of Asymptotic Inference ⋮ A numerical evaluation of some collinear scaling algorithms for unconstrained ⋮ Degenerate values for Broyden methods ⋮ Towards explicit superlinear convergence rate for SR1 ⋮ A compact updating formula for quasi-Newton minimization algorithms ⋮ Greedy PSB methods with explicit superlinear convergence ⋮ On the convergence, invariance, and related aspects of a modification of Huang's algorithm ⋮ Quasi Newton techniques generate identical points II: The proofs of four new theorems ⋮ Superlinear convergence of symmetric Huang's class of methods ⋮ Optimally conditioned optimization algorithms without line searches ⋮ Eigenvalues and switching algorithms for Quasi-Newton updates ⋮ An approach for analyzing the global rate of convergence of quasi-Newton and truncated-Newton methods ⋮ Updating of conjugate direction matrices using members of Broyden's family ⋮ Convergence property of a class of variable metric methods. ⋮ On the order of convergence of certain quasi-Newton methods ⋮ On iterative procedures of asymptotic inference ⋮ Accelerated conjugate direction methods for unconstrained optimization ⋮ Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations ⋮ New results on superlinear convergence of classical quasi-Newton methods ⋮ Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function ⋮ Finding the periodic solution of differential equation via solving optimization problem ⋮ Some investigations in a new algorithm for nonlinear optimization based on conic models of the objective function ⋮ On the connection between the conjugate gradient method and quasi-Newton methods on quadratic problems ⋮ Variable metric methods for unconstrained optimization and nonlinear least squares ⋮ An alternative variational principle for variable metric updating
Cites Work
- Variable Metric Method for Minimization
- A Rapidly Convergent Descent Method for Minimization
- Quasi-Newton Methods and their Application to Function Minimisation
- The Convergence of a Class of Double-rank Minimization Algorithms
- A new approach to variable metric algorithms
- On the Convergence of the Variable Metric Algorithm
- Optimal Conditioning of Quasi-Newton Methods
This page was built for publication: Quasi-newton algorithms generate identical points
