NONSMOOTH VECTOR FUNCTIONS AND CONTINUOUS OPTIMIZATION (SPRINGER OPTIMIZATION AND ITS APPLICATIONS, VOLUME 10)

JEYAKUMAR V. ET.AL

ISBN 10: 0387737162 / ISBN 13: 9780387737164

Editore: Springer, 2007

Riguardo questo articolo

This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Codice articolo ABNR-1558

Dati bibliografici

Titolo: NONSMOOTH VECTOR FUNCTIONS AND CONTINUOUS ...

Casa editrice: Springer

Data di pubblicazione: 2007

Legatura: Rilegato

Condizione: New

Descrizione articolo

Riassunto:

A recent significant innovation in mathematical sciences has been the progressive use of nonsmooth calculus, an extension of the differential calculus, as a key tool of modern analysis in many areas of mathematics, operations research, and engineering. Focusing on the study of nonsmooth vector functions, this book presents a comprehensive account of the calculus of generalized Jacobian matrices and their applications to continuous nonsmooth optimization problems and variational inequalities in finite dimensions.

The treatment is motivated by a desire to expose an elementary approach to nonsmooth calculus by using a set of matrices to replace the nonexistent Jacobian matrix of a continuous vector function. Such a set of matrices forms a new generalized Jacobian, called pseudo-Jacobian. A direct extension of the classical derivative that follows simple rules of calculus, the pseudo-Jacobian provides an axiomatic approach to nonsmooth calculus, a flexible tool for handling nonsmooth continuous optimization problems.

Illustrated by numerous examples of known generalized derivatives, the work may serve as a valuable reference for graduate students, researchers, and applied mathematicians who wish to use nonsmooth techniques and continuous optimization to model and solve problems in mathematical programming, operations research, and engineering. Readers require only a modest background in undergraduate mathematical analysis to follow the material with minimal effort.