Listing 1 - 10 of 103 | << page >> |
Sort by
|
Choose an application
Computational optimization is an active and important area of study, practice, and research today. It covers a wide range of applications in engineering, science, and industry. It provides solutions to a variety of real-life problems in the fields of health, business, government, military, politics, security, education, and many more. This book compiles original and innovative findings on all aspects of computational optimization. It presents various examples of optimization including cost, energy, profits, outputs, performance, and efficiency. It also discusses different types of optimization problems like nonlinearity, multimodality, discontinuity, and uncertainty. Over thirteen chapters, the book provides researchers, practitioners, academicians, military professionals, government officials, and other industry professionals with an in-depth discussion of the latest advances in the field.
Choose an application
In dieser Arbeit werden zur Überwachung von Drei-Wege-Katalysatoren zwei neue modellbasierte On-Board-Diagnoseverfahren vorgestellt. Zunächst wurde ein die Alterung mit berücksichtigendes physikalisches Katalysatormodell entwickelt. Dieses bildet die Grundlage der neuen Diagnoseverfahren, bei denen ein den aktuellen Zustand des Katalysators schätzender Sigma-Punkt-Kalman-Filter zum Einsatz kommt. Das große Potential dieser neuen Diagnoseverfahren zeigen die abschließend präsentierten Ergebnisse.
Abgastemperatur --- Spektrale Verfahren --- Constrained Sigma-Punkt-Kalman-Filter --- Drei-Wege-Katalysator-Modell --- On-Board-Diagnose
Choose an application
Optimization problems subject to constraints governed by partial differential equations (PDEs) are among the most challenging problems in the context of industrial, economical and medical applications. Almost the entire range of problems in this field of research was studied and further explored as part of the Deutsche Forschungsgemeinschaft (DFG) priority program 1253 on “Optimization with Partial Differential Equations” from 2006 to 2013. The investigations were motivated by the fascinating potential applications and challenging mathematical problems that arise in the field of PDE constrained optimization. New analytic and algorithmic paradigms have been developed, implemented and validated in the context of real-world applications. In this special volume, contributions from more than fifteen German universities combine the results of this interdisciplinary program with a focus on applied mathematics. The book is divided into five sections on “Constrained Optimization, Identification and Control”, “Shape and Topology Optimization”, “Adaptivity and Model Reduction”, “Discretization: Concepts and Analysis” and “Applications”. Peer-reviewed research articles present the most recent results in the field of PDE constrained optimization and control problems. Informative survey articles give an overview of topics that set sustainable trends for future research. This makes this special volume interesting not only for mathematicians, but also for engineers and for natural and medical scientists working on processes that can be modeled by PDEs.
Constrained optimization. --- Differential equations, Partial. --- Partial differential equations --- Optimization, Constrained --- Mathematical optimization --- Differential equations, partial. --- Mathematical optimization. --- Computer science --- Partial Differential Equations. --- Optimization. --- Computational Mathematics and Numerical Analysis. --- Mathematics. --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Mathematics --- Partial differential equations. --- Computer mathematics.
Choose an application
Operational research. Game theory --- Dynamic programming --- Programmation dynamique --- 519.85 --- 681.3*G16 --- Mathematical optimization --- Programming (Mathematics) --- Systems engineering --- Mathematical programming --- Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- 681.3*G16 Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- 519.85 Mathematical programming
Choose an application
Numerical methods of optimisation --- Conjugate direction methods --- 519.6 --- 681.3*G16 --- Computational mathematics. Numerical analysis. Computer programming --- Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- 681.3*G16 Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- 519.6 Computational mathematics. Numerical analysis. Computer programming
Choose an application
Two approaches are known for solving large-scale unconstrained optimization problems—the limited-memory quasi-Newton method (truncated Newton method) and the conjugate gradient method. This is the first book to detail conjugate gradient methods, showing their properties and convergence characteristics as well as their performance in solving large-scale unconstrained optimization problems and applications. Comparisons to the limited-memory and truncated Newton methods are also discussed. Topics studied in detail include: linear conjugate gradient methods, standard conjugate gradient methods, acceleration of conjugate gradient methods, hybrid, modifications of the standard scheme, memoryless BFGS preconditioned, and three-term. Other conjugate gradient methods with clustering the eigenvalues or with the minimization of the condition number of the iteration matrix, are also treated. For each method, the convergence analysis, the computational performances and the comparisons versus other conjugate gradient methods are given. The theory behind the conjugate gradient algorithms presented as a methodology is developed with a clear, rigorous, and friendly exposition; the reader will gain an understanding of their properties and their convergence and will learn to develop and prove the convergence of his/her own methods. Numerous numerical studies are supplied with comparisons and comments on the behavior of conjugate gradient algorithms for solving a collection of 800 unconstrained optimization problems of different structures and complexities with the number of variables in the range [1000,10000]. The book is addressed to all those interested in developing and using new advanced techniques for solving unconstrained optimization complex problems. Mathematical programming researchers, theoreticians and practitioners in operations research, practitioners in engineering and industry researchers, as well as graduate students in mathematics, Ph.D. and master students in mathematical programming, will find plenty of information and practical applications for solving large-scale unconstrained optimization problems and applications by conjugate gradient methods.
Conjugate gradient methods. --- Constrained optimization. --- Optimization, Constrained --- Mathematical optimization --- Gradient methods, Conjugate --- Approximation theory --- Equations --- Iterative methods (Mathematics) --- Numerical solutions --- Mathematical optimization. --- Mathematical models. --- Optimization. --- Mathematical Modeling and Industrial Mathematics. --- Models, Mathematical --- Simulation methods --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- System analysis
Choose an application
-519.85 --- Optimization: constrained optimization gradient methods integer programming least squares methods linear programming nonlinear programming (Numericalanalysis) --- 681.3*G16 Optimization: constrained optimization gradient methods integer programming least squares methods linear programming nonlinear programming (Numericalanalysis) --- Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- 681.3*G16 Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- Mathematical optimization --- 519.85 --- 519.8 --- 681.3*G16 --- 519.85 Mathematical programming --- Mathematical programming --- 519.8 Operational research --- Operational research --- Congresses --- Congresses. --- Optimisation mathématique --- Congrès --- Calculus of variations --- Operations research --- Programming (Mathematics) --- Programmation (mathématiques) --- Recherche opérationnelle --- Calcul des variations --- Optimisation mathématique --- Recherche opérationnelle. --- Optimisation mathématique. --- Mathematical optimization - Congresses --- Programmation (mathématiques) --- Recherche opérationnelle. --- Optimisation mathématique.
Choose an application
Programmation en nombres entiers --- 519.852 --- Linear programming. Simplex method --- Optimization: constrained optimization gradient methods integer programming least squares methods linear programming nonlinear programming (Numericalanalysis) --- 681.3*G16 Optimization: constrained optimization gradient methods integer programming least squares methods linear programming nonlinear programming (Numericalanalysis) --- 519.852 Linear programming. Simplex method --- 519.85 --- 681.3*G16 --- 681.3*G16 Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- 519.85 Mathematical programming --- Mathematical programming --- Integer programming --- Linear programming --- Production scheduling --- Programming (Mathematics) --- Operational research. Game theory --- Linear Programming --- Integer programming. --- Linear programming. --- Programmation linéaire --- Programmation (mathématiques) --- Programmation linéaire. --- Programmation en nombres entiers. --- Algebra lineal. --- Programación entera. --- Programación lineal. --- programación entera. --- Programmation (mathématiques) --- Programmation linéaire.
Choose an application
Linear topological spaces --- Mathematical optimization --- Vector spaces --- Espaces vectoriels topologiques --- Optimisation mathématique --- Espaces vectoriels --- Linear spaces --- Linear vector spaces --- Topological linear spaces --- Topological vector spaces --- Vector topology --- Optimization: constrained optimization gradient methods integer programming least squares methods linear programming nonlinear programming (Numericalanalysis) --- 519 --- Linear topological spaces. --- Vector spaces. --- 681.3*G16 Optimization: constrained optimization gradient methods integer programming least squares methods linear programming nonlinear programming (Numericalanalysis) --- Mathematical optimization. --- lineaire algebra --- operations research --- 681.3*G16 --- 681.3*G16 Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- Algebras, Linear --- Functional analysis --- Vector analysis --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Topology --- Nonlinear functional analysis. --- Analyse fonctionnelle non linéaire. --- Optimisation mathématique. --- Analyse numérique. --- Numerical analysis --- Numerical analysis. --- Analyse fonctionnelle non linéaire --- Analyse numérique --- Moindres carres
Choose an application
Planning (firm) --- Nonlinear programming --- Programmation non linéaire --- Operations Research. --- Programming, Linear. --- 681.3*G16 --- Linear Programming --- Research, Operations --- Decision Theory --- Game Theory --- Information Theory --- Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- Nonlinear programming. --- 681.3*G16 Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- Programmation non linéaire --- Operations Research --- Programming, Linear --- Programming (Mathematics) --- Operational Research --- Research, Operational
Listing 1 - 10 of 103 | << page >> |
Sort by
|