A globally convergent version of Robinson's algorithm for general nonlinear programming problems without using derivatives

Publisher Website

1 October 1981

journal article
research article
Published by Springer Nature in Journal of Optimization Theory and Applications

Vol. 35 (2) , 195-216
https://doi.org/10.1007/bf00934576

Abstract

No abstract available

Keywords

This publication has 4 references indexed in Scilit:

A globally and quadratically convergent algorithm for general nonlinear programming problems
Computing, 1981
A quasi-Newton method for minimization under linear constraints without evaluating any derivatives
Computing, 1979
A quadratically-convergent algorithm for general nonlinear programming problems
Mathematical Programming, 1972
Penalty function versus non-penalty function methods for constrained nonlinear programming problems
Mathematical Programming, 1971