Skip to main content
Erschienen in:
Buchtitelbild

2017 | OriginalPaper | Buchkapitel

1. Introduction

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

search-config
loading …

Abstract

This book is on nonlinear optimization in the GAMS technology. Continuous nonlinear optimization problems have a simple mathematical model and always refer to a system its running we want to optimize. Firstly, it contains an objective function which measures the performances or requirements of the system. Often, this function represents a profit, a time interval, a level, a sort of energy, or combination of different quantities which have a physical significance for the modeler. The objective function depends on some characteristics of the system, called variables or unknowns. The purpose of any optimization problem is to find the values of these variables that minimize (or maximize) the objective function, subject to some constraints the variables must satisfy. Constraints of an optimization problem may have different algebraic expressions. There are static and dynamic constraints called functional constraints. The difference between these types of constraints comes from the structure of their Jacobian. Another very important type of constraints is the simple bounds on variables. Both the objective function and the constraints may depend on some parameters with known values which represent the constructive characteristics of the system under optimization. The process of identifying the variables, parameters, the objective functions, and constraints is known as modeling, one of the finest intellectual activities. It is worth saying that in this book, we assume that the variables can take real values and the objective function and the constraints are smooth enough (at least twice differentiable) with known first-order derivatives. When the number of variables and the number of constraints are large, the optimization problem is quite challenging.

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!

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!

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!

Literatur
Zurück zum Zitat Andrei, N. (2009). Critica Raţiunii Algoritmilor de Optimizare fără Restricţii. [Criticism of the Unconstrained Optimization Algorithms Reasoning]. Editura Academiei Române, Bucureşti. Andrei, N. (2009). Critica Raţiunii Algoritmilor de Optimizare fără Restricţii. [Criticism of the Unconstrained Optimization Algorithms Reasoning]. Editura Academiei Române, Bucureşti.
Zurück zum Zitat Andrei, N. (2011a) Critica raţiunii algoritmilor de programare liniară. [Criticism of the Linear Programming Algorithms Reasoning]. Editura Academiei Române, Bucureşti. Andrei, N. (2011a) Critica raţiunii algoritmilor de programare liniară. [Criticism of the Linear Programming Algorithms Reasoning]. Editura Academiei Române, Bucureşti.
Zurück zum Zitat Andrei, N. (2013c). Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization. Journal of Optimization Theory and Applications, 159, 159–182.MathSciNetCrossRefMATH Andrei, N. (2013c). Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization. Journal of Optimization Theory and Applications, 159, 159–182.MathSciNetCrossRefMATH
Zurück zum Zitat Andrei, N. (2015). Critica Raţiunii Algoritmilor de Optimizare cu Restricţii. [Criticism of the Constrained Optimization Algorithms Reasoning]. Bucureşti, Balkans: Editura Academiei Române Andrei, N. (2015). Critica Raţiunii Algoritmilor de Optimizare cu Restricţii. [Criticism of the Constrained Optimization Algorithms Reasoning]. Bucureşti, Balkans: Editura Academiei Române
Zurück zum Zitat Armijo, L. (1966). Minimization of functions having Lipschitz continuous first partial derivatives. Pacific Journal of Mathematics, 16(1), 1–3.MathSciNetCrossRefMATH Armijo, L. (1966). Minimization of functions having Lipschitz continuous first partial derivatives. Pacific Journal of Mathematics, 16(1), 1–3.MathSciNetCrossRefMATH
Zurück zum Zitat Averick, B. M., Carter, R. G., Moré, J. J., & Xue, G. L. (1992). The MINPACK-2 test problem collection. (Mathematics and Computer Science Division, Argonne National Laboratory, 9700 South Cass Avenue, Argonne, Illinois, Preprint MCS-P153–6092, June 1992). Averick, B. M., Carter, R. G., Moré, J. J., & Xue, G. L. (1992). The MINPACK-2 test problem collection. (Mathematics and Computer Science Division, Argonne National Laboratory, 9700 South Cass Avenue, Argonne, Illinois, Preprint MCS-P153–6092, June 1992).
Zurück zum Zitat Bartholomew-Biggs, M. (2008). Nonlinear optimization with engineering applications. New York, NY, USA: Springer Science +Business Media.CrossRefMATH Bartholomew-Biggs, M. (2008). Nonlinear optimization with engineering applications. New York, NY, USA: Springer Science +Business Media.CrossRefMATH
Zurück zum Zitat Bazaraa, M. S., Sherali, H. D., & Shetty, C. M. (1993). Nonlinear programming theory and algorithms (2nd ed.). New York, NY, USA: Wiley.MATH Bazaraa, M. S., Sherali, H. D., & Shetty, C. M. (1993). Nonlinear programming theory and algorithms (2nd ed.). New York, NY, USA: Wiley.MATH
Zurück zum Zitat Bertsekas, D. P. (1999). Nonlinear programming (2nd ed.). Belmont, CA, USA: Athena Scientific.MATH Bertsekas, D. P. (1999). Nonlinear programming (2nd ed.). Belmont, CA, USA: Athena Scientific.MATH
Zurück zum Zitat Birgin, E. G., Martínez, J. M., & Raydan, M. (2000). Nonmonotone spectral projected gradient methods on convex sets. SIAM Journal on Optimization, 10, 1196–1211.MathSciNetCrossRefMATH Birgin, E. G., Martínez, J. M., & Raydan, M. (2000). Nonmonotone spectral projected gradient methods on convex sets. SIAM Journal on Optimization, 10, 1196–1211.MathSciNetCrossRefMATH
Zurück zum Zitat Birgin, E. G., Martínez, J. M., & Raydan, M. (2001). Algorithm 813: SPG - software for convex-constrained optimization. ACM Transactions on Mathematical Software, 27, 340–349.CrossRefMATH Birgin, E. G., Martínez, J. M., & Raydan, M. (2001). Algorithm 813: SPG - software for convex-constrained optimization. ACM Transactions on Mathematical Software, 27, 340–349.CrossRefMATH
Zurück zum Zitat Boyd, S., & Vandenberghe, L. (2006). Convex optimization (2nd ed.). Cambridge, UK: Cambridge University Press.MATH Boyd, S., & Vandenberghe, L. (2006). Convex optimization (2nd ed.). Cambridge, UK: Cambridge University Press.MATH
Zurück zum Zitat Byrd, R. H., Lu, P., Nocedal, J., & Zhu, C. (1995b). A limited memory algorithm for bound constrained optimization. SIAM Journal on Scientific Computing, 16, 1190–1208.MathSciNetCrossRefMATH Byrd, R. H., Lu, P., Nocedal, J., & Zhu, C. (1995b). A limited memory algorithm for bound constrained optimization. SIAM Journal on Scientific Computing, 16, 1190–1208.MathSciNetCrossRefMATH
Zurück zum Zitat Byrd, R. H., Gould, N. I. M., Nocedal, J., & Waltz, R. A. (2004). An algorithm for nonlinear optimization using linear programming and equality constrained subproblems. Mathematical Programming, Series B, 100, 27–48.MathSciNetMATH Byrd, R. H., Gould, N. I. M., Nocedal, J., & Waltz, R. A. (2004). An algorithm for nonlinear optimization using linear programming and equality constrained subproblems. Mathematical Programming, Series B, 100, 27–48.MathSciNetMATH
Zurück zum Zitat Chin, C. M., & Fletcher, R. (2003). On the local convergence of an SLP-filter algorithm that takes EQP steps. Mathematical Programming (Series A), 96, 161–177.CrossRefMATH Chin, C. M., & Fletcher, R. (2003). On the local convergence of an SLP-filter algorithm that takes EQP steps. Mathematical Programming (Series A), 96, 161–177.CrossRefMATH
Zurück zum Zitat Conn, A. R., Gould, N. I. M., & Toint, P. L. (1991). A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds. SIAM Journal on Numerical Analysis, 28, 545–572.MathSciNetCrossRefMATH Conn, A. R., Gould, N. I. M., & Toint, P. L. (1991). A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds. SIAM Journal on Numerical Analysis, 28, 545–572.MathSciNetCrossRefMATH
Zurück zum Zitat Conn, A. R., Gould, N. I. M., & Toint, P. L. (1992b). LANCELOT - A fortran package for large-scale nonlinear optimization (Release A), Springer series in computational mathematics (vol. 17). Berlin, Europe: Springer.MATH Conn, A. R., Gould, N. I. M., & Toint, P. L. (1992b). LANCELOT - A fortran package for large-scale nonlinear optimization (Release A), Springer series in computational mathematics (vol. 17). Berlin, Europe: Springer.MATH
Zurück zum Zitat Dantzig, G. B. (1963). Linear programming and extensions. Princeton, NJ, USA: Princeton University Press.CrossRefMATH Dantzig, G. B. (1963). Linear programming and extensions. Princeton, NJ, USA: Princeton University Press.CrossRefMATH
Zurück zum Zitat Fiacco, A. V., & McCormick, G. P. (1964). The sequential unconstrained minimization technique for nonlinear programming. A primal-dual method. Management Science, 10, 360–366. Fiacco, A. V., & McCormick, G. P. (1964). The sequential unconstrained minimization technique for nonlinear programming. A primal-dual method. Management Science, 10, 360–366.
Zurück zum Zitat Fletcher, R. (1987). Practical methods of optimization (2nd ed.). New York, NY, USA: Wiley.MATH Fletcher, R. (1987). Practical methods of optimization (2nd ed.). New York, NY, USA: Wiley.MATH
Zurück zum Zitat Fletcher, R., & Leyffer, S. (2002). Nonlinear programming without a penalty function. Mathematical Programming, Series A, 91, 239–269.MathSciNetCrossRefMATH Fletcher, R., & Leyffer, S. (2002). Nonlinear programming without a penalty function. Mathematical Programming, Series A, 91, 239–269.MathSciNetCrossRefMATH
Zurück zum Zitat Fletcher, R., & Leyffer, S. (2003). Filter-type algorithms for solving systems of algebraic equations and inequalities. In G. di Pillo & A. Murli (Eds.), High performance algorithms and software for nonlinear optimization (pp. 259–278). Norwell, MA, USA: Kluwer Academic Publishers. Fletcher, R., & Leyffer, S. (2003). Filter-type algorithms for solving systems of algebraic equations and inequalities. In G. di Pillo & A. Murli (Eds.), High performance algorithms and software for nonlinear optimization (pp. 259–278). Norwell, MA, USA: Kluwer Academic Publishers.
Zurück zum Zitat Fletcher, R., & Sainz de la Maza, E. (1989). Nonlinear programming and nonsmooth optimization by successive linear programming. Mathematical Programming, 43, 235–256.MathSciNetCrossRefMATH Fletcher, R., & Sainz de la Maza, E. (1989). Nonlinear programming and nonsmooth optimization by successive linear programming. Mathematical Programming, 43, 235–256.MathSciNetCrossRefMATH
Zurück zum Zitat Friedlander, M. P., & Saunders, M. (2005). A globally convergent linearly constrained Lagrangian method for nonlinear optimization. SIAM Journal on Optimization, 15, 863–897.MathSciNetCrossRefMATH Friedlander, M. P., & Saunders, M. (2005). A globally convergent linearly constrained Lagrangian method for nonlinear optimization. SIAM Journal on Optimization, 15, 863–897.MathSciNetCrossRefMATH
Zurück zum Zitat Gill, P. E., Murray, W., & Saunders, M. A. (2005). SNOPT: An SQP algorithm for large-scale constrained optimization. SIAM Review, 47, 99–131.MathSciNetCrossRefMATH Gill, P. E., Murray, W., & Saunders, M. A. (2005). SNOPT: An SQP algorithm for large-scale constrained optimization. SIAM Review, 47, 99–131.MathSciNetCrossRefMATH
Zurück zum Zitat Gould, N. I. M., & Robinson, D. P. (2008). A second derivative SQP methods: Local convergence. (Numerical Analysis Report 08/21, Oxford University Computing Laboratory. 2008). Gould, N. I. M., & Robinson, D. P. (2008). A second derivative SQP methods: Local convergence. (Numerical Analysis Report 08/21, Oxford University Computing Laboratory. 2008).
Zurück zum Zitat Gould, N. I. M., & Robinson, D. P. (2010). A second derivative SQP methods: Global convergence. SIAM Journal on Optimization, 20, 2023–2048.MathSciNetCrossRefMATH Gould, N. I. M., & Robinson, D. P. (2010). A second derivative SQP methods: Global convergence. SIAM Journal on Optimization, 20, 2023–2048.MathSciNetCrossRefMATH
Zurück zum Zitat Griffith, R. E., & Stewart, R. A. (1961). A nonlinear programming technique for the optimization of continuous processing systems. Management Science, 7(4), 379–392.MathSciNetCrossRefMATH Griffith, R. E., & Stewart, R. A. (1961). A nonlinear programming technique for the optimization of continuous processing systems. Management Science, 7(4), 379–392.MathSciNetCrossRefMATH
Zurück zum Zitat Grötschel, M. (Ed.) (2012). Optimization stories. Documenta Mathematica, Journal der Deutschen Mathematiker-Vereinigung, Berlin. Grötschel, M. (Ed.) (2012). Optimization stories. Documenta Mathematica, Journal der Deutschen Mathematiker-Vereinigung, Berlin.
Zurück zum Zitat Lenstra, J. K., Rinnooy Kan, A. H. G., & Schrijver, A. (1991). History of Mathematical Programming. A collection of personal reminiscences. Amsterdam, the Netherlands: CWI Amsterdam and North-Holland.MATH Lenstra, J. K., Rinnooy Kan, A. H. G., & Schrijver, A. (1991). History of Mathematical Programming. A collection of personal reminiscences. Amsterdam, the Netherlands: CWI Amsterdam and North-Holland.MATH
Zurück zum Zitat Leyffer, S., & Mahajan, A. (2010). Foundations of constrained optimization. (Preprint ANL/MCS-P1767–0610. Argonne National Laboratory, Mathematics and Computer Science Division, June 17, 2010). Leyffer, S., & Mahajan, A. (2010). Foundations of constrained optimization. (Preprint ANL/MCS-P1767–0610. Argonne National Laboratory, Mathematics and Computer Science Division, June 17, 2010).
Zurück zum Zitat Luenberger, D. G. (1973). Introduction to linear and nonlinear programming. Reading, UK: Addison-Wesley Publishing Company.MATH Luenberger, D. G. (1973). Introduction to linear and nonlinear programming. Reading, UK: Addison-Wesley Publishing Company.MATH
Zurück zum Zitat Luenberger, D. G. (1984). Introduction to linear and nonlinear programming (2nd ed.). Reading, UK: Addison-Wesley Publishing Company.MATH Luenberger, D. G. (1984). Introduction to linear and nonlinear programming (2nd ed.). Reading, UK: Addison-Wesley Publishing Company.MATH
Zurück zum Zitat Luenberger, D. G., & Ye, Y. (2008). Linear and nonlinear programming, International series in operations research & management science (vol. 116, 3rd ed.). New York, NY, USA: Springer.MATH Luenberger, D. G., & Ye, Y. (2008). Linear and nonlinear programming, International series in operations research & management science (vol. 116, 3rd ed.). New York, NY, USA: Springer.MATH
Zurück zum Zitat Maratos, N. (1978). Exact penalty function algorithms for finite-dimensional and control optimization problems. Ph. D. Thesis, University of London. Maratos, N. (1978). Exact penalty function algorithms for finite-dimensional and control optimization problems. Ph. D. Thesis, University of London.
Zurück zum Zitat Moré, J. J., & Toraldo, G. (1991). On the solution of large quadratic programming problems with bound constraints. SIAM Journal on Optimization, 1, 93–113.MathSciNetCrossRefMATH Moré, J. J., & Toraldo, G. (1991). On the solution of large quadratic programming problems with bound constraints. SIAM Journal on Optimization, 1, 93–113.MathSciNetCrossRefMATH
Zurück zum Zitat Nash, S. G. (1984b). User’s guide for TN/TNBC: Fortran routines for nonlinear optimization. (Report 397, Baltimore, MD: Mathematical Sciences Department, The John Hopkins University). Nash, S. G. (1984b). User’s guide for TN/TNBC: Fortran routines for nonlinear optimization. (Report 397, Baltimore, MD: Mathematical Sciences Department, The John Hopkins University).
Zurück zum Zitat Nash, S. G. (1985). Preconditioning of truncated-Newton methods. SIAM Journal on Scientific and Statistical Computing, 6, 599–616.MathSciNetCrossRefMATH Nash, S. G. (1985). Preconditioning of truncated-Newton methods. SIAM Journal on Scientific and Statistical Computing, 6, 599–616.MathSciNetCrossRefMATH
Zurück zum Zitat Nesterov, Y., & Nemirovskii, A. (1994). Interior-point polynomial algorithms in convex programming. Philadelphia, PA, USA: SIAM.CrossRefMATH Nesterov, Y., & Nemirovskii, A. (1994). Interior-point polynomial algorithms in convex programming. Philadelphia, PA, USA: SIAM.CrossRefMATH
Zurück zum Zitat Nocedal, J., & Wright, S. J. (2006). Numerical optimization, Springer series in operations research (2nd ed.). New York, NY, USA: Springer Science+Business Media.MATH Nocedal, J., & Wright, S. J. (2006). Numerical optimization, Springer series in operations research (2nd ed.). New York, NY, USA: Springer Science+Business Media.MATH
Zurück zum Zitat Omojokun, E. (1989). Trust region algorithms for optimization with nonlinear equality and inequality constraints. Ph.D. Disertation, Department of Computer Science, University of Colorado. Omojokun, E. (1989). Trust region algorithms for optimization with nonlinear equality and inequality constraints. Ph.D. Disertation, Department of Computer Science, University of Colorado.
Zurück zum Zitat Sun, W., & Yuan, Y. X. (2006). Optimization theory and methods. Nonlinear programming. New York, NY, USA: Springer Science + Business Media.MATH Sun, W., & Yuan, Y. X. (2006). Optimization theory and methods. Nonlinear programming. New York, NY, USA: Springer Science + Business Media.MATH
Zurück zum Zitat Vanderbei, R. J. (2001). Linear programming: Foundations and extensions (2nd ed.). New York, NY, USA: Springer.CrossRefMATH Vanderbei, R. J. (2001). Linear programming: Foundations and extensions (2nd ed.). New York, NY, USA: Springer.CrossRefMATH
Zurück zum Zitat Vardi, A. (1985). A trust region algorithm for equality constrained minimization: convergence properties and implementation. SIAM Journal on Numerical Analysis, 22, 575–591.MathSciNetCrossRefMATH Vardi, A. (1985). A trust region algorithm for equality constrained minimization: convergence properties and implementation. SIAM Journal on Numerical Analysis, 22, 575–591.MathSciNetCrossRefMATH
Metadaten
Titel
Introduction
verfasst von
Neculai Andrei
Copyright-Jahr
2017
DOI
https://doi.org/10.1007/978-3-319-58356-3_1