Author : Gianni Pillo
Publisher : Springer Science & Business Media
Page : 297 pages
File Size : 30,80 MB
Release : 2006-06-03
Category : Mathematics
ISBN : 0387300651
This book reviews and discusses recent advances in the development of methods and algorithms for nonlinear optimization and its applications, focusing on the large-dimensional case, the current forefront of much research. Individual chapters, contributed by eminent authorities, provide an up-to-date overview of the field from different and complementary standpoints, including theoretical analysis, algorithmic development, implementation issues and applications.
Author : Neculai Andrei
Publisher : Springer Nature
Page : 824 pages
File Size : 39,11 MB
Release : 2022-10-18
Category : Mathematics
ISBN : 3031087208
This book includes a thorough theoretical and computational analysis of unconstrained and constrained optimization algorithms and combines and integrates the most recent techniques and advanced computational linear algebra methods. Nonlinear optimization methods and techniques have reached their maturity and an abundance of optimization algorithms are available for which both the convergence properties and the numerical performances are known. This clear, friendly, and rigorous exposition discusses the theory behind the nonlinear optimization algorithms for understanding their properties and their convergence, enabling the reader to prove the convergence of his/her own algorithms. It covers cases and computational performances of the most known modern nonlinear optimization algorithms that solve collections of unconstrained and constrained optimization test problems with different structures, complexities, as well as those with large-scale real applications. The book is addressed to all those interested in developing and using new advanced techniques for solving large-scale unconstrained or constrained complex optimization 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 in mathematical programming will find plenty of recent information and practical approaches for solving real large-scale optimization problems and applications.
Author : Lorenz T. Biegler
Publisher : Springer Science & Business Media
Page : 347 pages
File Size : 15,38 MB
Release : 2012-12-06
Category : Mathematics
ISBN : 364255508X
Optimal design, optimal control, and parameter estimation of systems governed by partial differential equations (PDEs) give rise to a class of problems known as PDE-constrained optimization. The size and complexity of the discretized PDEs often pose significant challenges for contemporary optimization methods. With the maturing of technology for PDE simulation, interest has now increased in PDE-based optimization. The chapters in this volume collectively assess the state of the art in PDE-constrained optimization, identify challenges to optimization presented by modern highly parallel PDE simulation codes, and discuss promising algorithmic and software approaches for addressing them. These contributions represent current research of two strong scientific computing communities, in optimization and PDE simulation. This volume merges perspectives in these two different areas and identifies interesting open questions for further research.
Author : Natalia M. Alexandrov
Publisher : SIAM
Page : 476 pages
File Size : 26,6 MB
Release : 1997-01-01
Category : Design
ISBN : 9780898713596
Multidisciplinary design optimization (MDO) has recently emerged as a field of research and practice that brings together many previously disjointed disciplines and tools of engineering and mathematics. MDO can be described as a technology, environment, or methodology for the design of complex, coupled engineering systems, such as aircraft, automobiles, and other mechanisms, the behavior of which is determined by interacting subsystems.
Author : Neculai Andrei
Publisher : Springer
Page : 514 pages
File Size : 13,73 MB
Release : 2017-12-04
Category : Mathematics
ISBN : 3319583565
This book presents the theoretical details and computational performances of algorithms used for solving continuous nonlinear optimization applications imbedded in GAMS. Aimed toward scientists and graduate students who utilize optimization methods to model and solve problems in mathematical programming, operations research, business, engineering, and industry, this book enables readers with a background in nonlinear optimization and linear algebra to use GAMS technology to understand and utilize its important capabilities to optimize algorithms for modeling and solving complex, large-scale, continuous nonlinear optimization problems or applications. Beginning with an overview of constrained nonlinear optimization methods, this book moves on to illustrate key aspects of mathematical modeling through modeling technologies based on algebraically oriented modeling languages. Next, the main feature of GAMS, an algebraically oriented language that allows for high-level algebraic representation of mathematical optimization models, is introduced to model and solve continuous nonlinear optimization applications. More than 15 real nonlinear optimization applications in algebraic and GAMS representation are presented which are used to illustrate the performances of the algorithms described in this book. Theoretical and computational results, methods, and techniques effective for solving nonlinear optimization problems, are detailed through the algorithms MINOS, KNITRO, CONOPT, SNOPT and IPOPT which work in GAMS technology.
Author : Nimrod Megiddo
Publisher : Springer Science & Business Media
Page : 164 pages
File Size : 43,14 MB
Release : 2012-12-06
Category : Mathematics
ISBN : 1461396174
The starting point of this volume was a conference entitled "Progress in Mathematical Programming," held at the Asilomar Conference Center in Pacific Grove, California, March 1-4, 1987. The main topic of the conference was developments in the theory and practice of linear programming since Karmarkar's algorithm. There were thirty presentations and approximately fifty people attended. Presentations included new algorithms, new analyses of algorithms, reports on computational experience, and some other topics related to the practice of mathematical programming. Interestingly, most of the progress reported at the conference was on the theoretical side. Several new polynomial algorithms for linear program ming were presented (Barnes-Chopra-Jensen, Goldfarb-Mehrotra, Gonzaga, Kojima-Mizuno-Yoshise, Renegar, Todd, Vaidya, and Ye). Other algorithms presented were by Betke-Gritzmann, Blum, Gill-Murray-Saunders-Wright, Nazareth, Vial, and Zikan-Cottle. Efforts in the theoretical analysis of algo rithms were also reported (Anstreicher, Bayer-Lagarias, Imai, Lagarias, Megiddo-Shub, Lagarias, Smale, and Vanderbei). Computational experiences were reported by Lustig, Tomlin, Todd, Tone, Ye, and Zikan-Cottle. Of special interest, although not in the main direction discussed at the conference, was the report by Rinaldi on the practical solution of some large traveling salesman problems. At the time of the conference, it was still not clear whether the new algorithms developed since Karmarkar's algorithm would replace the simplex method in practice. Alan Hoffman presented results on conditions under which linear programming problems can be solved by greedy algorithms."
Author : Leonhard Bittner
Publisher : Birkhäuser
Page : 354 pages
File Size : 26,96 MB
Release : 2012-12-06
Category : Mathematics
ISBN : 3034888023
The 12th conference on "Variational Calculus, Optimal Control and Applications" took place September 23-27, 1996, in Trassenheide on the Baltic Sea island of Use dom. Seventy mathematicians from ten countries participated. The preceding eleven conferences, too, were held in places of natural beauty throughout West Pomerania; the first time, in 1972, in Zinnowitz, which is in the immediate area of Trassenheide. The conferences were founded, and led ten times, by Professor Bittner (Greifswald) and Professor KlCitzler (Leipzig), who both celebrated their 65th birthdays in 1996. The 12th conference in Trassenheide, was, therefore, also dedicated to L. Bittner and R. Klotzler. Both scientists made a lasting impression on control theory in the former GDR. Originally, the conferences served to promote the exchange of research results. In the first years, most of the lectures were theoretical, but in the last few conferences practical applications have been given more attention. Besides their pioneering theoretical works, both honorees have also always dealt with applications problems. L. Bittner has, for example, examined optimal control of nuclear reactors and associated safety aspects. Since 1992 he has been working on applications in optimal control in flight dynamics. R. Klotzler recently applied his results on optimal autobahn planning to the south tangent in Leipzig. The contributions published in these proceedings reflect the trend to practical problems; starting points are often questions from flight dynamics.
Author : Lorenz T. Biegler
Publisher : Springer Science & Business Media
Page : 212 pages
File Size : 48,36 MB
Release : 2012-12-06
Category : Mathematics
ISBN : 1461206936
With contributions by specialists in optimization and practitioners in the fields of aerospace engineering, chemical engineering, and fluid and solid mechanics, the major themes include an assessment of the state of the art in optimization algorithms as well as challenging applications in design and control, in the areas of process engineering and systems with partial differential equation models.
Author : L.T. Watson
Publisher : Gulf Professional Publishing
Page : 392 pages
File Size : 49,66 MB
Release : 2001-03-28
Category : Mathematics
ISBN : 9780444505996
After a review of historical developments in convergence analysis for Newton's and Newton-like methods, 18 papers deal in depth with various classical, or neo-classical approaches, as well as newer ideas on optimization and solving linear equations. A sampling of topics: truncated Newton methods, sequential quadratic programming for large- scale nonlinear optimization, and automatic differentiation of algorithms. This monograph, one of seven volumes in the set, is also published as the Journal of Computational and Applied Mathematics; v.124 (2000). Indexed only by author. c. Book News Inc.
Author : Michael Patriksson
Publisher : Springer Science & Business Media
Page : 343 pages
File Size : 16,62 MB
Release : 2013-06-29
Category : Mathematics
ISBN : 147572991X
Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather differently, are closely related to each other. This book is meant to help the reader understand and relate algorithms to each other in some intuitive fashion, and represents, in this respect, a consolidation of the field. The framework of algorithms presented in this book is called Cost Approxi mation. (The preface of the Ph.D. thesis [Pat93d] explains the background to the work that lead to the thesis, and ultimately to this book.) It describes, for a given formulation of a variational inequality or nonlinear programming problem, an algorithm by means of approximating mappings and problems, a principle for the update of the iteration points, and a merit function which guides and monitors the convergence of the algorithm. One purpose of this book is to offer this framework as an intuitively appeal ing tool for describing an algorithm. One of the advantages of the framework, or any reasonable framework for that matter, is that two algorithms may be easily related and compared through its use. This framework is particular in that it covers a vast number of methods, while still being fairly detailed; the level of abstraction is in fact the same as that of the original problem statement.
