Optimization Theory and Methods

Nonlinear Programming

AvWenyu Sun,Ya-Xiang Yuan

Inbunden, Engelska, 2006

Del 1 i serien Springer Optimization and Its Applications

1 921 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Häftad

1 709 kr

Beskrivning

Optimization Theory and Methods can be used as a textbook for an optimization course for graduates and senior undergraduates. It is the result of the author's teaching and research over the past decade. It describes optimization theory and several powerful methods. For most methods, the book discusses an idea's motivation, studies the derivation, establishes the global and local convergence, describes algorithmic steps, and discusses the numerical performance.

Produktinformation

Utgivningsdatum:2006-05-24
Mått:156 x 235 x 42 mm
Vikt:1 203 g
Format:Inbunden
Språk:Engelska
Serie:Springer Optimization and Its Applications
Antal sidor:687
Upplaga:2006
Förlag:Springer-Verlag New York Inc.
ISBN:9780387249759

Utforska kategorier

Recensioner i media

From the reviews: "The book contains a comprehensive presentation of methods for unconstrained and constrained optimization problems. ... The main strength of the book is the precise convergence analysis of most nonlinear programming algorithms presented, and it is especially comprehensive for line search, Newton, quasi-Newton, trust region and SQP methods. In this respect the book is a very valuable reference." (Darinka Dentcheva, Mathematical Reviews, Issue 2007 c) "Optimization is a subject that is widely and increasingly used in science, engineering, economics, management, industry, and other areas. ... The book is self-contained, systematic in theory and algorithms, and easy to read. ... The book also contains an extensive ... bibliography with 366 references, which is an important part of the book, and is useful to readers for further studies. Each chapter ends with an exercise set." (Alexandr B. Vasil'ev, Zentralblatt MATH, Vol. 1129 (7), 2008)

Innehållsförteckning

Line Search.- Newton’s Methods.- Conjugate Gradient Method.- Quasi-Newton Methods.- Trust-Region Methods and Conic Model Methods.- Solving Nonlinear Least-Squares Problems.- Theory of Constrained Optimization.- Quadratic Programming.- Penalty Function Methods.- Feasible Direction Methods.- Sequential Quadratic Programming.- Trust-Region Methods for Constrained Problems.- Nonsmooth Optimization.