On the rate of convergence of sequential unconstrained minimization techniques
Großmann, Ch. ; Kaplan, A. A.
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique, Tome 17 (1983), p. 267-292 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1983-01-01
@article{M2AN_1983__17_3_267_0,
     author = {Gro\ss mann, Ch. and Kaplan, A. A.},
     title = {On the rate of convergence of sequential unconstrained minimization techniques},
     journal = {ESAIM: Mathematical Modelling and Numerical Analysis - Mod\'elisation Math\'ematique et Analyse Num\'erique},
     volume = {17},
     year = {1983},
     pages = {267-292},
     mrnumber = {702138},
     zbl = {0526.65043},
     language = {en},
     url = {http://dml.mathdoc.fr/item/M2AN_1983__17_3_267_0}
}

Großmann, Ch.; Kaplan, A. A. On the rate of convergence of sequential unconstrained minimization techniques. ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique, Tome 17 (1983) pp. 267-292. http://gdmltest.u-ga.fr/item/M2AN_1983__17_3_267_0/

[1] D. P. Bertsekas, Onpenalty and multiplier methods for constrained minimization, SIAM J. Control Optimization 14 (1976) 2, 216-235. | MR 408830 | Zbl 0324.49029

[2] L. Bittner, Eine Verallgemeinerung des Verfahrens des logarithmischen Potentials von Frisch fur nichtlineare Optimierungsprobleme, Aus : Prékopa, A. (éd.) : Colloque on appl. math, to econ. Budapest, 1965, 43-53. | MR 189817 | Zbl 0142.16905

[3] I. I. Eremin, Metod strafov v vypuklom programmirovanii, Dokl. AN SSSR 173 (1967) 4, 748-751. | MR 214377 | Zbl 0155.28405

[4] A. V. Fiacco, G. P. Mccormick, Nonlinear programming : sequential unconstrained minimization techniques, Wiley, New York, 1968 | MR 243831 | Zbl 0193.18805

[5] E. G. Gol'Stejn, N. V. Tret-Jakov, Modifieirovannye funkcii Lagranza. Ekon. Mat. Metody 10 (1974) 3, 568-691.

[6] C. Grobmann, Rates of convergence in methods of exterior centers, Math. OF Statist. Optimization 9 (1978) 3, 373-388. | MR 522576 | Zbl 0389.65030

[7] C. Grobmann, Common properties of nonlinear programming algorithms basing on sequential unconstrained minimizations. Proc. 7-th Sum. School « Nonlin. Anal», 1979. Akademie Verlag, 1981, 107-117. | MR 639915 | Zbl 0468.90065

[8] C. Grobmann, Sensitivitatsanalyse als einheitlicher Zugang zu den Verfahren der sukzessiven unrestringierten Minimierung, Diss. B, TU Dresden, 1979.

[9] C. Grobmann, A. A. Kaplan, Strafmethoden und modifizierte Lagrangefunktionen in der nichtlinearen Optimierung, Teubner-Text, Teubner Verlag, Leipzig, 1979. | MR 581367 | Zbl 0425.65035

[10] C. Grobmann, G. Schontger, Sensitivitat und Anwendbarkeit von Straf-Barriere- Methoden, ZAMM 57 (1977), 255-264. | MR 445378 | Zbl 0406.90066

[11] M. Hamala, A general approach to interior point methods with linear parameter for mathematical programming, TRITA-MAT- 1978-20, Royal Inst. Techn., Stockholm.

[12] J. Hartung, A stable interior penalty method for convex extremal problems, Numer. Math. 29 (1978), 149-158. | MR 469273 | Zbl 0368.90114

[13] J. Hartung, On exponential penalty function methods, Math. OF Statist. Optimization. | Zbl 0514.90077

[14] A. A. Kaplan, O skorosti shodimosti metoda strofov, Dokl. AN SSSR 229 (1976) 2, 288-291. | Zbl 0357.90050

[15] A. A. Kaplan, K analizu nekotoryh ocenok skorosti shodimosti metoda strafov, Optimizacija 21 (1978).

[16] A. A. Kaplan, Methods of nonlinear programming applied to solving variational inequlities, Conf. «Mathematical Programming», Eisenach, 1980.

[17] B. W. Kort, D. P. Bertsekas, Combined primal-dual mathods for convex programming, SIAM J. Control Optimization 14 (1976), 268-294. | MR 401148 | Zbl 0332.90035

[18] M. Kovac, O regularizacii nekorrektnyh ekstrema'nyh zadac s ispol'zovaniem metoda ba'ernyh funkcii, Cisl. Analiz. Budapest, 1978, 62-78.

[19] S. Kurcyusz, J. Majchrzak, Morrison-type algorithms for constrained optimization. | Zbl 0443.90093

[20] F. A. Lootsma, Boundary properties of penalty functions for constrained minimization, Philips Res.Rept., Suppl. 3, 1970. | MR 299222

[21] F. A. Lootsma Convergence rates of quadratic exterior penalty function methods for solving constrained minimization problems, Philips Res. Rept. 29 (1974), 1-12. | MR 366036 | Zbl 0356.90052

[22] R. Mifflin, Convergence bounds for nonlinear programming algorithms, Math. Programming 8 (1975) 3, 251-271. | MR 376154 | Zbl 0326.90055

[23] R. Mifflin, Rates of convergence for a method of centers algorithm, JOTA 18 (1976) 2, 199-228. | MR 416600 | Zbl 0299.65036

[24] B. T. Poljak, O slorosti shodimosti metoda strafnyh funkcij, ZBMMF 11 (1971) 1, 3-11.

[25] R. T. Rockafellar, Asual approach to solving nonliinear programming problems by unconstrained optimization, Math. Programming 5 (1973), 354-373. | MR 371416 | Zbl 0279.90035

[26] R. T. Rockafellar, Augmented Lagrangians and applications of the proximal point algorithm in convex programming, Math. Operations Res. 1 (1976) 2, 97-116. | MR 418919 | Zbl 0402.90076

[27] V. D. Skarin, Ob odnoj modifikacii metoda strafnyh funkcij v vypoklom programmirovanii, Trudy Instituta Mat. Meh. Sverdlovsk 5 (1973), 51-62. | MR 472044

[28] A. N. Tihonov, F. P. Vasil'Ev, Metody resenija nekorreltnyh ekstrema'nyh zadac, Banach Centers Publications, Vol. 3, Warszawa, 1978, 197-342. | Zbl 0384.65027

[29] F. P. Vasil'Ev, O regularizacii nekorrektnyh ekstremal'nyh zadac, Dokl. AN SSSR 241 (1978) 5, 1001-1004. | Zbl 0423.90059

[30] F. P. Vasil'Ev, M. Kovac, O regularizacii nekorrektnyh ekstremal-nyh zadac v cocetanii so strafnymi finkcijami obscego vida, Problemy Vycisl. Mat. i Sistemnogo Pragrammirovanija, Budapest, 1980, 19-41. | MR 596240 | Zbl 0443.90110