A globally contergent method for nonlinear programming

References

• Bräuninger J. A modification of Robinson's algorithm for general nonlinear programming problems requiring only approximate solutions of subproblems with linear Ruality constraints Springer Verlag Berlin 1978 In: J. Stoer, Optimization Techniques, Part 2, Lecture Notes in control and Information Sciences No.7 Heidelberg New York
   Google Scholar
• Fiacco , A.V. and McCormick , G.P. 1968 . Nonlinear programming: Sequential unconstrained minimization techniques , John Wiley & Sons .
   Google Scholar
• Han , S.P. 1976 . Superlinearly convergent variable metric algorithm for general nonlinear programming problems . Mathematical Programming , 11 : 263 – 282 .
   Web of Science ®Google Scholar
• Himmelblau , D.M. 1972 . Applied nonlinear programming , McGraw-Hill .
   Google Scholar
• Jahn , J. 1978 . “ Sequentieller Innerer-Punkt-Algorithmus zur Lösung nichtlinearer Optimierungsprobleme ” . In Dissertation Darmstadt
   Google Scholar
• Jahn , J. 1979 . An Interior Point Method for Nonlinear Programming . Zeitschrift fur Operations Research , 23 : 1 – 15 .
   Google Scholar
• Jahn , J. 1979 . Lösung nichtlinearer Optimienmgsprobleme mit Nebenbedingungen , Edited by: Späth , H. Oldenburg-Verlag . Operations Research Software
   Google Scholar
• Luenberger , D.G. 1973 . Introduction to Linear and Nonlinear Programming , Addison-Wesley Publishing Company .
   Google Scholar
• Pironneau , O. and Polak , E. 1973 . Rate of convergence of a class of methods of feasible directions . SIAM Journal Num. Anal , 10 : 161 – 174 .
   Web of Science ®Google Scholar
• Polak , E. 1972 . Computational methods in optimization: a unified approach , Academic Press .
   Google Scholar
• Robinson , S.M. 1972 . A quadratically-convergent algorithm for general nonlinear programming problems . Mathematical Programming , 3 : 145 – 156 .
   Google Scholar