Image from Google Jackets

Convexity and Well-Posed Problems [recurso electrónico] / by Roberto Lucchetti.

Por: Colaborador(es): Tipo de material: TextoTextoSeries Canadian Mathematical SocietyEditor: New York, NY : Springer New York, 2006Descripción: XIV, 305 p. 46 illus. online resourceTipo de contenido:
  • text
Tipo de medio:
  • computer
Tipo de soporte:
  • recurso en línea
ISBN:
  • 9780387310824
  • 99780387310824
Tema(s): Formatos físicos adicionales: Printed edition:: Sin títuloClasificación CDD:
  • 515.64 23
Recursos en línea:
Contenidos:
Convex sets and convex functions: the fundamentals -- Continuity and ?(X) -- The derivatives and the subdifferential -- Minima and quasi minima -- The Fenchel conjugate -- Duality -- Linear programming and game theory -- Hypertopologies, hyperconvergences -- Continuity of some operations between functions -- Well-posed problems -- Generic well-posedness -- More exercises.
En: Springer eBooksResumen: Intended for graduate students especially in mathematics, physics, and economics, this book deals with the study of convex functions and of their behavior from the point of view of stability with respect to perturbations. The primary goal is the study of the problems of stability and well-posedness, in the convex case. Stability means the basic parameters of a minimum problem do not vary much if we slightly change the initial data. Well-posedness means that points with values close to the value of the problem must be close to actual solutions. In studying this, one is naturally led to consider perturbations of both functions and of sets. The book includes a discussion of numerous topics, including: * hypertopologies, ie, topologies on the closed subsets of a metric space; * duality in linear programming problems, via cooperative game theory; * the Hahn-Banach theorem, which is a fundamental tool for the study of convex functions; * questions related to convergence of sets of nets; * genericity and porosity results; * algorithms for minimizing a convex function. In order to facilitate use as a textbook, the author has included a selection of examples and exercises, varying in degree of difficulty. Robert Lucchetti is Professor of Mathematics at Politecnico di Milano. He has taught this material to graduate students at his own university, as well as the Catholic University of Brescia, and the University of Pavia.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode
Libros electrónicos Libros electrónicos CICY Libro electrónico Libro electrónico 515.64 (Browse shelf(Opens below)) Available

Convex sets and convex functions: the fundamentals -- Continuity and ?(X) -- The derivatives and the subdifferential -- Minima and quasi minima -- The Fenchel conjugate -- Duality -- Linear programming and game theory -- Hypertopologies, hyperconvergences -- Continuity of some operations between functions -- Well-posed problems -- Generic well-posedness -- More exercises.

Intended for graduate students especially in mathematics, physics, and economics, this book deals with the study of convex functions and of their behavior from the point of view of stability with respect to perturbations. The primary goal is the study of the problems of stability and well-posedness, in the convex case. Stability means the basic parameters of a minimum problem do not vary much if we slightly change the initial data. Well-posedness means that points with values close to the value of the problem must be close to actual solutions. In studying this, one is naturally led to consider perturbations of both functions and of sets. The book includes a discussion of numerous topics, including: * hypertopologies, ie, topologies on the closed subsets of a metric space; * duality in linear programming problems, via cooperative game theory; * the Hahn-Banach theorem, which is a fundamental tool for the study of convex functions; * questions related to convergence of sets of nets; * genericity and porosity results; * algorithms for minimizing a convex function. In order to facilitate use as a textbook, the author has included a selection of examples and exercises, varying in degree of difficulty. Robert Lucchetti is Professor of Mathematics at Politecnico di Milano. He has taught this material to graduate students at his own university, as well as the Catholic University of Brescia, and the University of Pavia.

There are no comments on this title.

to post a comment.