Numerical optimization (Q4255577)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1324815
Language Label Description Also known as
default for all languages
No label defined
    English
    Numerical optimization
    scientific article; zbMATH DE number 1324815

      Statements

      Numerical Optimization (English)
      0 references
      Numerical optimization (English)
      0 references
      0 references
      0 references
      18 August 1999
      0 references
      numerical optimization
      0 references
      textbook
      0 references
      algorithms
      0 references
      large-scale optimization
      0 references
      interior-point methods
      0 references
      inexact Newton methods
      0 references
      limited-memory methods
      0 references
      automatic differentiation
      0 references
      trust-region methods
      0 references
      sequential quadratic programming
      0 references
      constrained optimization
      0 references
      quasi-Newton methods
      0 references
      nonlinear least squares
      0 references
      nonlinear equations
      0 references
      simplex method
      0 references
      penalty and barrier methods
      0 references
      software packages
      0 references
      The main goal of the book is to give a comprehensive description of the most powerful, state-of-the-art techniques for solving optimization problems. Since the currently used algorithms are called to handle problems much larger and complex than in the past, the authors emphasized the large-scale optimization techniques, such as interior-point methods, inexact Newton methods, limited-memory methods, and the role of partially separable functions and automatic differentiation. Other important topics such as trust-region methods, sequential quadratic programming, constrained optimization theory, Newton and quasi-Newton methods, nonlinear least squares and nonlinear equations, the simplex method, penalty and barrier methods for nonlinear programming are detailedly and comprehensively discussed. The book is addressed in general to the people interested in solving optimization problems, and may be used as a (two-semester) graduated-level course in optimization for the engineering, operations research, computer science, and mathematics departments. The presentation style of the book facilitates the self-study and direct application of practitioners in engineering, basic science, and industry. A typical chapter begins with a non-rigorous discussion of the topic at hand, including figures and diagrams and excluding technical details as far as possible. The algorithms are motivated, analyzed and stated explicitly. The major theoretical results are enclosed and, in many cases, proved in a rigorous fashion. These proofs may be skipped. The examples throughout the book show how practical problems are formulated as optimization problems, and the proposed treatment of the optimization process modelling is light, serving mainly to set the stage for the algorithmic developments. The users of optimization software may address the NEOS Guide at \url{http://www.mcs.anl.gov/otc/Guide/SoftwareGuide/} for the specific software packages and latest changes.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references