Welcome to P K Kelkar Library, Online Public Access Catalogue (OPAC)

Normal view MARC view ISBD view

Convexity and Well-Posed Problems

By: Lucchetti, Roberto [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: CMS Books in Mathematics: Publisher: New York, NY : Springer New York : Imprint: Springer, 2006.Description: XIV, 305 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9780387310824.Subject(s): Mathematics | Functional analysis | Calculus of variations | Operations research | Management science | Mathematics | Calculus of Variations and Optimal Control; Optimization | Operations Research, Management Science | Functional AnalysisDDC classification: 515.64 Online resources: Click here to access online
Contents:
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.
In: Springer eBooksSummary: 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.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode Item holds
E books E books PK Kelkar Library, IIT Kanpur
Available EBK7727
Total holds: 0

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 for this item.

Log in to your account to post a comment.

Powered by Koha