Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- 1 December 1976
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 11 (1) , 263-282
- https://doi.org/10.1007/bf01580395
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A globally convergent method for nonlinear programmingJournal of Optimization Theory and Applications, 1977
- A characterization of superlinear convergence and its application to quasi-Newton methodsMathematics of Computation, 1974
- A general saddle point result for constrained optimizationMathematical Programming, 1973
- On the Local and Superlinear Convergence of Quasi-Newton MethodsIMA Journal of Applied Mathematics, 1973
- Variable metric algorithms: Necessary and sufficient conditions for identical behavior of nonquadratic functionsJournal of Optimization Theory and Applications, 1972
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality ConstraintsSIAM Journal on Applied Mathematics, 1969
- Variable metric methods of minimisationThe Computer Journal, 1969
- A Modification of Davidon's Minimization Method to Accept Difference Approximations of DerivativesJournal of the ACM, 1967
- A class of methods for solving nonlinear simultaneous equationsMathematics of Computation, 1965
- A Rapidly Convergent Descent Method for MinimizationThe Computer Journal, 1963