Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Introduction Kapitel lesen Erstes Kapitel lesen

2021 | OriginalPaper | Buchkapitel

8. Realizations of the NR Principle

verfasst von : Roman A. Polyak

Erschienen in: Introduction to Continuous Optimization

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

We concentrate on three important realizations of NR principle: modified log-barrier function (MBF), exterior distance function (EDF), and log-sigmoid (LS) Lagrangian. The correspondent NR methods can be viewed as alternatives to both SUMT and IPMs (see Chapters 5 and 6).

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel Nonlinear Rescaling: Theory and Methods
Nächstes Kapitel Lagrangian Transformation and Interior Ellipsoid Methods
Literatur
Alber, M., Reemtsen, R.: Intensity modulated radiotherapy treatment planning by use of a barrier-penalty multiplier method. Optim. Methods Software 22(3), 391–411 (2007)MathSciNetMATHCrossRef
Auslender, A., Teboulle, M.: Interior projection-like methods for monotone variational inequalities. Math. Program. 104(1), 39–68 (2005)MathSciNetMATHCrossRef
Auslender, R., Cominetti, R., Haddou, M.: Asymptotic analysis for penalty and barrier methods in convex and linear programming. Math. Oper. Res. 22(1), 43–62 (1997)MathSciNetMATHCrossRef
Auslender, A., Teboulle, M., Ben-Tiba S.: Interior proximal and multipliers methods based on second-order homogeneous kernels. Math. Oper. Res. 24(3), 645–668 (1999)MathSciNetMATHCrossRef
Ben-Tal, A., Nemirovski, A.: Optimal design of engineering structures. In: Optima, vol. 47 (1995)
Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization Analysis, Algorithms and Engineering Applications. SIAM, Philadelphia (2001)
Ben-Tal, A., Yuzefovich, B., Zibulevsky, M.: Penalty-Barrier Multipliers Method for Minimax and Constrained Smooth Convex Optimization. Technion, Research report, pp. 9–92 (1992)
Berke, L., Khot, N., Polyak, R., Schneur, R.: Structural optimization using Newton modified barrier method. Struct. Optim. 10(3), 209–216 (1995)MATH
Breitfeld, M., Shanno, D.: Computational experience with modified log-barrier methods for nonlinear programming. Annals Oper. Res. 62, 439–464 (1996)MathSciNetMATHCrossRef
Carroll, C.: The created response surface technique for optimizing nonlinear-restrained systems. Oper. Res. 9(2), 169–184 (1961)MathSciNetMATHCrossRef
Chen, C., Mangasarian, O.L.: Smoothing methods for convex inequalities and linear complementarity problems. Math. Program. 71, 51–69 (1995)MathSciNetMATHCrossRef
Daube-Witherspoon, M., Muehllehner: An iterative space reconstruction algorithm suitable for volume ECT. IEEE Trans. Med. Imaging 5, 61–66 (1986)CrossRef
Fiacco, A.V., McCormick, G.P.: Nonlinear Programming: Sequential Unconstrained Minimization Techniques. SIAM, Philadelphia (1990)MATHCrossRef
Frisch, K.: The Logarithmic Potential Method for Solving Linear Programming Problems, Memorandum. University Institute of Economics, Oslo (1955)
Gill, P., Murray, W., Saunders, J., Tomlin, J., Wright, M.: On projected Newton Barrier methods for linear programming and an equivalence to Karmarkar’s projective method. Math. Program. 36, 183–209 (1986)MathSciNetMATHCrossRef
Goffin, J., Vial, J.: On the computation of weighted analytic centers and dual ellipsoids with the projective AlgoRithm. Math. Program. 60, 81–92 (1993)MathSciNetMATHCrossRef
Gonzaga, C.: An algorithm for solving linear programming problems in O(n 3 L) operations. In: Megiddo, N. (ed.) Progress in Mathematical Programming: Interior Point and Related Methods, pp. 1–28. Springer, New York (1989)
Griva, I., Polyak, R.: Primal-dual nonlinear rescaling methods for convex optimization. J. Optim. Theory Appl. (JOTA) 122(1), 111–156 (2004)
Griva, I., Polyak, R.: Primal-dual nonlinear rescaling method with dynamic scaling parameter update. Math. Program. Ser. A 106, 237–259 (2006)MathSciNetMATHCrossRef
Griva, I., Polyak, R., Sobieski, J.: The Newton log-sigmoid method in constrained optimization, a collection of technical papers. In: Proceedings of the 7th AIAA/USAF/NASA/ISSMO Symposium on Multidisciplinary Analysis and Optimization, vol. 3, pp. 2193–2201 (1998)
Grossman, K., Kaplan, A.A.: Nonlinear programming based on unconstrained minimization. Novosibirsk, Nauka (1981), in Russian
Huard, P.: A method of centres by upper-bounding function with applications. In: Non-linear Programming. North Holland, Amsterdam, pp. 1–30 (1967)
Huard, P.: Resolution of mathematical programming with nonlinear constraints by the method of centers. In: Abadie, J. (ed.) Nonlinear Programming, pp. 207–219. North Holland, Amsterdam (1970)
Jarre, F., Sonnevend, G., Stoer, G.: An Implementation of the method of analytic centers. In: Benoussan, A., Lions, J.L. (eds.) Lecture Notes in Control and Information Sciences, vol. 111. Springer, Berlin (1988)
Jensen, D., Polyak, R.: The convergence of MBF method for convex programming. IBM J. Res. Dev. 38, 307–321 (1994)MATHCrossRef
Jensen, D., Polyak, R., Schneur, R.: Experience with Modified Barrier Function Methods for Linear Programming, Research Report Department of Mathematical Sciences, vol. 10598. IBM T.J. Watson Research Center, New York, pp. 1–35 (1993)
Kanzow, C.: Global convergence properties of some iterative methods for linear complementarity problems. SIAM Optim. 6, 326–341 (1996)MathSciNetMATHCrossRef
Knopp, K.: Infinite Sequence and Series. Dover Publication Inc., New York (1956)MATH
Kočvara, M., Stingl, M.: Resent Progress in the NLP-SDP Code PENNON, Workshop “Optimization and Applications”, Oberwalfach (2005)
Kočvara, M., Stingl, M.: On the solution of large-scale SDP problems by the modified barrier method using iterative solvers. Math. Program. Series B 109(2–3), 413–444 (2007)MathSciNetMATHCrossRef
Kočvara, M., Stingl, M.: PENNON: Software for Linear and Nonlinear Matrix Inequalities (2015). arXiv:1504.07212v2 [mat. OC]
Lieu, B.-T., Huard, P.: La methods des centres dans un espace topologique. Num. Mat. 8(1), 56–67 (1966)MATHCrossRef
Mangasarian, O.: Mathematical programming in neural networks. ORSA J. Comput. 5(4), 349–360 (1993)MATHCrossRef
Nash, S., Polyak, R., Sofer, A.: A numerical comparison of barrier and modified – barrier methods for large–scale bound–constrained optimization. In: Large scale Optimization: State of Art. Kluwer Academic, Dordrecht (1994)
Nesterov, Y., Nemirovski, A.: Interior Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)CrossRef
Polak E.: Computational Methods in Optimization: A Unified Approach. Academic Press, New York (1971)
Polyak, B.: Introduction to Optimization. Optimization Software, New York (1987)MATH
Polyak, R.: Modified Barrier and center methods, reposts from the Moscow Refusnik seminar. In: Annals of the New York Academy of Sciences, New York, vol. 491, pp. 194–196 (1987)
Polyak, R.: Modified Barrier Functions in Linear Programming. IBM Research Report, RC 17790 (No. 78331), pp. 1–55 (1992)
Polyak, R.: Modified Interior Distance Functions in Optimization Methods in Partial Differential Equations. In: Series: Contemporary Mathematics, vol. 209. AMS, New York (1997)
Polyak, R.: Nonlinear rescaling vs. smoothing technique in constrained optimization. Math. Program. 92, 197–235 (2002)
Polyak, R., Teboulle, M.: Nonlinear rescaling and proximal–like methods in convex programming. Math. Program. 76, 265–284 (1997)MATHCrossRef
Powell, M.: Some convergence properties of the modified log barrier methods for linear programming. SIAM J. Optim. 50(4), 695–739 (1995)MathSciNetMATHCrossRef
Renegar, J.: A polynomial -time algorithm, based on Newton’s method, for linear programming. Math. Program. 40, 59–93 (1988)MathSciNetMATHCrossRef
Shanno, D., Breitfeld, M., Simantiraki, E.: Implementing barrier methods for nonlinear programming. In: Terlaky, T. (ed.) Interior Point Methods of Mathematical Programming, pp 369–398, Kluwer Academic Publishers, Dordrecht (1996)MATH
Shepp, L., Vardi, Y.: Maximin likelihood reconstruction in emission tomography. IEEE Trans. Med. Imaging 1(2), 113–122 (1982)CrossRef
Sonnevend, Gy.: An “analytic center” for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In: Prekopa, A., Szelezsan, J., Strazicky, B. (eds.) System modeling and optimization: proceedings of the 12th IFIP-conference held in budapest, Hungary, September 1985. Lecture Notes in Control and Information Sciences, vol. 84, pp 866–876. Springer, Berlin (1986)
Tseng, P., Bertsekas, D.: On the convergence of the exponential multipliers method for convex programming. Math. Program. 60, 1–19 (1993)MathSciNetMATHCrossRef
Vaidya, P.: An algorithm for linear programming which requires O((m + n)n 2 + (m + n)1.5 nL) arithmetic operations. Math. Program. 47, 175–201 (1990)
Metadaten
Titel
Realizations of the NR Principle
verfasst von
Roman A. Polyak
Copyright-Jahr
2021
Buch
Introduction to Continuous Optimization

Print ISBN: 978-3-030-68711-3

Electronic ISBN: 978-3-030-68713-7

Copyright-Jahr: 2021

DOI
https://doi.org/10.1007/978-3-030-68713-7_8