Newton-type methods for unconstrained and linearly constrained optimization
- 1 December 1974
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 7 (1) , 311-350
- https://doi.org/10.1007/bf01585529
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the Estimation of Sparse Jacobian MatricesIMA Journal of Applied Mathematics, 1974
- Methods for modifying matrix factorizationsMathematics of Computation, 1974
- A numerically stable form of the simplex algorithmLinear Algebra and its Applications, 1973
- Quasi-Newton Methods for Unconstrained OptimizationIMA Journal of Applied Mathematics, 1972
- Derivative free analogues of the Levenberg-Marquardt and Gauss algorithms for nonlinear least squares approximationNumerische Mathematik, 1971
- Numerical Techniques in Mathematical ProgrammingPublished by Elsevier ,1970
- An effective algorithm for minimizationNumerische Mathematik, 1967
- On the relative efficiencies of gradient methodsMathematics of Computation, 1967
- Symmetric decomposition of a positive definite matrixNumerische Mathematik, 1965
- Linear least squares solutions by householder transformationsNumerische Mathematik, 1965