Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- 1 December 1976
- journal article
- research article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 11 (1), 1-13
- https://doi.org/10.1007/bf01580366
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- A feasible conjugate-direction method to solve linearly constrained minimization problemsJournal of Optimization Theory and Applications, 1975
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithmsMathematical Programming, 1974
- A quadratically-convergent algorithm for general nonlinear programming problemsMathematical Programming, 1972
- Penalty function versus non-penalty function methods for constrained nonlinear programming problemsMathematical Programming, 1971
- On the Numerical Solution of Constrained Least-Squares ProblemsSIAM Journal on Numerical Analysis, 1971
- An effective algorithm for minimizationNumerische Mathematik, 1967