On the Superlinear Convergence of an Algorithm for Solving a Sparse Minimization Problem
- 1 December 1979
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 16 (6) , 1036-1045
- https://doi.org/10.1137/0716076
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Some numerical results using a sparse matrix updating formula in unconstrained optimizationMathematics of Computation, 1978
- On sparse and symmetric matrix updating subject to a linear equationMathematics of Computation, 1977
- Quasi-Newton Methods, Motivation and TheorySIAM Review, 1977
- On the Global Convergence of Broyden's MethodMathematics of Computation, 1976
- A characterization of superlinear convergence and its application to quasi-Newton methodsMathematics of Computation, 1974
- A New Algorithm for Unconstrained OptimizationPublished by Elsevier ,1970
- Maximization by Quadratic Hill-ClimbingEconometrica, 1966