Sold out

Convex Analysis and Global Optimization

English · Hardback

Description

Read more

Due to the general complementary convex structure underlying most nonconvex optimization problems encountered in applications, convex analysis plays an essential role in the development of global optimization methods. This book develops a coherent and rigorous theory of deterministic global optimization from this point of view. Part I constitutes an introduction to convex analysis, with an emphasis on concepts, properties and results particularly needed for global optimization, including those pertaining to the complementary convex structure. Part II presents the foundation and application of global search principles such as partitioning and cutting, outer and inner approximation, and decomposition to general global optimization problems and to problems with a low-rank nonconvex structure as well as quadratic problems. Much new material is offered, aside from a rigorous mathematical development.
Audience: The book is written as a text for graduate students in engineering, mathematics, operations research, computer science and other disciplines dealing with optimization theory. It is also addressed to all scientists in various fields who are interested in mathematical optimization.

Product details

Authors Hoang Tuy, Hoang Tuy
Assisted by Hoang Tuy (Editor)
Publisher Springer, Berlin
 
Content Book
Product form Hardback
Publication date 29.06.2009
Subject Natural sciences, medicine, IT, technology > Mathematics > Miscellaneous
 
EAN 9780792348184
ISBN 978-0-7923-4818-4
Pages 340
Illustrations XI, 339 p.
Dimensions (packing) 16 x 24 cm
Weight (packing) 676 g
 
Series Nonconvex Optimization and Its Applications > Vol.22
Nonconvex Optimization and Its Applications > 22
 

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.