A special newton-type optimization method

References

• Abadie , J. 1986 . “ Generalized reduced gradient and global Newton methods. In: Optimization and related fields ” . In Lecture notes in Mathematics , Edited by: Conti , R. , Giorgi , E.Di. and Giannessi , F. Vol. 1190 , 1 – 20 . Berlin : Springer Verlag .
   Google Scholar
• Burmeister , W. 1985 . W.Private communication , Dresden .
   Google Scholar
• Clarke , F.H. 1983 . Optimization and Nonsmooth Analysis , New York : Wiley .
   Google Scholar
• Colemann , T.F. and Conn , A.R. 1982 . Nonlinear programming via an exact penalty function, Parts I and 11 . Mathematical Programming , 24 : 123 – 161 .
   Web of Science ®Google Scholar
• Evtušenko , Ju. 1983 . Metody rešenija ékstremal’nyh zadač i ih primenenie v sistemah optimizacii Nauka Moskva
   Google Scholar
• Evtušenko , Ju.G. and Purtov , V.A. 1984 . Sufficient conditions for a minimum for nonlinear programming problems . Soviet.Math.Dokl , 30 : 313 – 316 .
   Google Scholar
• Fischer , A. 07-11 1985 . “ Defektfunktionale bei Ungleichungen und gedämpfte gestörte Newton-Verfahren Preprint ” . Edited by: Beckmann , M. and Künzi , H.P. Vol. 187 , 07-11 , TU Dresden : Department of Mathematics .
   Google Scholar
• Fischer , A. 1989 . On weakening regularity conditions for Newton-type methods for nonlinear constrained optimization . Proceedings Conference Math. Opt., Eisenach . 1989 . pp. 61 – 64 .
   Google Scholar
• Hock , W. and Schittkowski , K. 1981 . “ Test Examples for Nonlinear Programming Codes ” . In Lecture Notes in Economics and Mathematical Systems , Edited by: Beckmann , M. and Künzi , H.P. Vol. 187 , Berlin : Springer-Verlag . Heidelberg, New York
   Google Scholar
• Ižutkin , V.S. and Kokurin , M.Ju. 1988 . Metody privedennyh napravlenij dlja rešenija zadači nelinejnovo programmirovanija . Ž. Vyčisl. Mat. i Mat. Fis , 28 : 1799 – 1814 .
   Google Scholar
• Kleinmichel , H. and Schpnefeld , K. 1989 . Newton-type methods for nonlinearly constrained programming problems—algorithms and theory . Optimization , 19 : 397 – 412 .
   Google Scholar
• Kleinmchel , H. and Schönefeld , K. 1989 . Newton-type methods for nonlinearly constrained programming problems—Pascal-program and numerical experiments . Wiss. Z. TU Dresden , 38 : 219 – 224 .
   Google Scholar
• Kleinmichel , H. and Schönefeld , K. 07-11 1989 . “ Superlinearly convergent optimization methods without solving QP. Preprint ” . Edited by: Beckmann , M. and Künzi , H.P. 07-11 , TU Dresden : Department of Mathematics .
   Google Scholar
• Kojima , M. and Hirabayashi , R. 1984 . Continuous deformations of nonlinear programs . Mathematical Programming Study , 21 : 150 – 198 .
   Web of Science ®Google Scholar
• Kojima , M. and Shindo , S. 1986 . Extension of Newton and Quasi-Newton methods to systems of PC1 Equations . Journal of Operations Research Society of Japan , 29 : 352 – 374 .
   Web of Science ®Google Scholar
• Kummer , B. 1988 . Newton’s method for non-differentiable functions. In: Mathematical Research.Advances in Mathematical Optimization , 114 – 125 . Berlin : AKademie verlag .
   Google Scholar
• Kummer , B. 1991 . Newton' s method based on generalized derivaties for nonsmooth functions . Convergence analysis. Working Paper, . 1991 . pp. 61 – 64 . Berlin : Department of Mathematics, Humboldt-University .
   Google Scholar
• Pang , J.S. 1990 . Newton’s method for B-differentiable equations . Math. of Operations Res , 15 : 311 – 341 .
   Web of Science ®Google Scholar
• Pšeničnyj , B.N. and Sobolenko , L.A. 1980 . Uskorenie shodimosti metoda linearizacii dlja zadati uslovnoj minimizacii . Ž. Vyčisl. Mat. i Mat. Fis , 20 : 605 – 614 .
   Google Scholar
• Purtov , V.A. 1991 . “ Fast convergent nonlinear programming methods. In: Numerical Methods of Nonlinear Programming and their Implementations ” . In Mathematical Research , Edited by: Richter , C. , Hollatz , C. and Pallaschke , D. Vol. 60 , 87 – 98 . Berlin : Akademie Verlag .
   Google Scholar
• Ralph and Global , D. . convergence of damped Newton’s method for nonsmooth equations, via the path search. . Technical Report TR 90-1181 . 1990 . December , Ithaca, New York : Department of Computer Science, Cornell University .
   Google Scholar
• Robinson , S.M. 1974 . Perturbed Kuhn–Tucker points and rate of convergence for a class of nonlinear programming algorithms . Mathematical Programming , 7 : 1 – 16 .
   Google Scholar
• Robinson , S.M. 1887 . Local structure of feasible sets in nonlinear programming, Part 111: Stability and Sensitivity . Mathematical Programming Study , 30 : 45 – 66 .
   Google Scholar
• Robinson , S. M. . Newton’s method for a class of nonsmooth functions. . Manuscript . 1990 . University of Wisconsin-Madison : Department of Industrial Engineering .
   Google Scholar
• Schittkowski , K. 1981 . The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function, Parts I and 11 . Numer.Math , 38 : 83 – 127 .
   Web of Science ®Google Scholar
• Schonefeld K. Uber lokale Optimierungsverfahren und deren Kopplung mit global konvergenten Verfahren Technical report 1989 Dissertation B, TU Dresden
   Google Scholar
• Spedicato , E. 1982 . On a Newton-like method for constrained nonlinear optimization . JOTA , 36 : 175 – 190 .
   Web of Science ®Google Scholar
• Tapia , R.A. and Tone , K. 1983 . Revisions of constrained approximations in the successive QP method for non-linear programming problems . Mathematical Programming , 26 : 144 – 152 .
   Web of Science ®Google Scholar
• Tone K. Revisions of constrained approximations in the successive QP method for non-linear programming problems. Mathematical Programming 1983 26 144 152
   Web of Science ®Google Scholar
• Wierzbicki , A.P. 1982 . Note on the equivalence of Kuhn-Tucker complementarity conditions to an equation . JOTA , 37 : 401 – 405 .
   Web of Science ®Google Scholar
• Wilson R.B. A simplical algorithm for concave programming. Ph.D. Dissertation Technical report 1963 Harvard University,Cambridge, Mass
   Google Scholar