Free Access
Issue
RAIRO. Anal. numér.
Volume 17, Number 3, 1983
Page(s) 267 - 292
DOI https://doi.org/10.1051/m2an/1983170302671
Published online 31 January 2017
  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] [Google Scholar]
  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] [Google Scholar]
  3. I. I. EREMIN, Metod strafov v vypuklom programmirovanii, Dokl. AN SSSR 173 (1967) 4, 748-751. [MR: 214377] [Zbl: 0155.28405] [Google Scholar]
  4. A. V. FIACCO, G. P. MCCORMICK, Nonlinear programming : sequential unconstrained minimization techniques, Wiley, New York, 1968 [MR: 243831] [Zbl: 0193.18805] [Google Scholar]
  5. E. G. GOL'STEJN, N. V. TRET-JAKOV, Modifieirovannye funkcii Lagranza. Ekon. Mat. Metody 10 (1974) 3, 568-691. [Google Scholar]
  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] [Google Scholar]
  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] [Google Scholar]
  8. C. GROBMANN, Sensitivitatsanalyse als einheitlicher Zugang zu den Verfahren der sukzessiven unrestringierten Minimierung, Diss. B, TU Dresden, 1979. [Google Scholar]
  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] [Google Scholar]
  10. C. GROBMANN, G. SCHONTGER, Sensitivitat und Anwendbarkeit von Straf-Barriere- Methoden, ZAMM 57 (1977), 255-264. [MR: 445378] [Zbl: 0406.90066] [Google Scholar]
  11. M. HAMALA, A general approach to interior point methods with linear parameter for mathematical programming, TRITA-MAT- 1978-20, Royal Inst. Techn., Stockholm. [Google Scholar]
  12. J. HARTUNG, A stable interior penalty method for convex extremal problems, Numer. Math. 29 (1978), 149-158. [EuDML: 132510] [MR: 469273] [Zbl: 0368.90114] [Google Scholar]
  13. J. HARTUNG, On exponential penalty function methods, Math. OF Statist. Optimization. [Zbl: 0514.90077] [Google Scholar]
  14. A. A. KAPLAN, O skorosti shodimosti metoda strofov, Dokl. AN SSSR 229 (1976) 2, 288-291. [Zbl: 0357.90050] [Google Scholar]
  15. A. A. KAPLAN, K analizu nekotoryh ocenok skorosti shodimosti metoda strafov, Optimizacija 21 (1978). [Google Scholar]
  16. A. A. KAPLAN, Methods of nonlinear programming applied to solving variational inequlities, Conf. «Mathematical Programming», Eisenach, 1980. [Google Scholar]
  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] [Google Scholar]
  18. M. KOVAC, O regularizacii nekorrektnyh ekstrema'nyh zadac s ispol'zovaniem metoda ba'ernyh funkcii, Cisl. Analiz. Budapest, 1978, 62-78. [Google Scholar]
  19. S. KURCYUSZ, J. MAJCHRZAK, Morrison-type algorithms for constrained optimization. [Zbl: 0443.90093] [Google Scholar]
  20. F. A. LOOTSMA, Boundary properties of penalty functions for constrained minimization, Philips Res.Rept., Suppl. 3, 1970. [MR: 299222] [Google Scholar]
  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] [Google Scholar]
  22. R. MIFFLIN, Convergence bounds for nonlinear programming algorithms, Math. Programming 8 (1975) 3, 251-271. [MR: 376154] [Zbl: 0326.90055] [Google Scholar]
  23. R. MIFFLIN, Rates of convergence for a method of centers algorithm, JOTA 18 (1976) 2, 199-228. [MR: 416600] [Zbl: 0299.65036] [Google Scholar]
  24. B. T. POLJAK, O slorosti shodimosti metoda strafnyh funkcij, ZBMMF 11 (1971) 1, 3-11. [Google Scholar]
  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] [Google Scholar]
  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] [Google Scholar]
  27. V. D. SKARIN, Ob odnoj modifikacii metoda strafnyh funkcij v vypoklom programmirovanii, Trudy Instituta Mat. Meh. Sverdlovsk 5 (1973), 51-62. [MR: 472044] [Google Scholar]
  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] [Google Scholar]
  29. F. P. VASIL'EV, O regularizacii nekorrektnyh ekstremal'nyh zadac, Dokl. AN SSSR 241 (1978) 5, 1001-1004. [Zbl: 0423.90059] [Google Scholar]
  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] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.

Recommended for you