Shortcuts
Please wait while page loads.
SISSA Library . Default .
PageMenu- Main Menu-
Page content

Catalogue Display

Convex Analysis and Minimization Algorithms I: Fundamentals

Convex Analysis and Minimization Algorithms I: Fundamentals
Catalogue Information
Field name Details
Dewey Class 515.64
Title Convex Analysis and Minimization Algorithms I ([EBook]) : Fundamentals / by Jean-Baptiste Hiriart-Urruty, Claude Lemaréchal
Author Hiriart-Urruty, Jean-Baptiste. , 1949-
Added Personal Name Lemaréchal, Claude
Other name(s) SpringerLink (Online service)
Publication Berlin, Heidelberg : Springer Berlin Heidelberg , 1993
Physical Details XVIII, 418 p. : online resource.
Series Grundlehren der mathematischen Wissenschaften, A Series of Comprehensive Studies in Mathematics 0072-7830 ; ; 305
ISBN 9783662027967
Summary Note Convex Analysis may be considered as a refinement of standard calculus, with equalities and approximations replaced by inequalities. As such, it can easily be integrated into a graduate study curriculum. Minimization algorithms, more specifically those adapted to non-differentiable functions, provide an immediate application of convex analysis to various fields related to optimization and operations research. These two topics making up the title of the book, reflect the two origins of the authors, who belong respectively to the academic world and to that of applications. Part I can be used as an introductory textbook (as a basis for courses, or for self-study); Part II continues this at a higher technical level and is addressed more to specialists, collecting results that so far have not appeared in books.:
Contents note Table of Contents Part I -- I. Convex Functions of One Real Variable -- II. Introduction to Optimization Algorithms -- III. Convex Sets -- IV. Convex Functions of Several Variables -- V. Sublinearity and Support Functions -- VI. Subdifferentials of Finite Convex Functions -- VII. Constrained Convex Minimization Problems: Minimality Conditions, Elements of Duality Theory -- VIII. Descent Theory for Convex Minimization: The Case of Complete Information -- Appendix: Notations -- 1 Some Facts About Optimization -- 2 The Set of Extended Real Numbers -- 3 Linear and Bilinear Algebra -- 4 Differentiation in a Euclidean Space -- 5 Set-Valued Analysis -- 6 A Bird’s Eye View of Measure Theory and Integration -- Bibliographical Comments -- References.
System details note Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site http://dx.doi.org/10.1007/978-3-662-02796-7
Links to Related Works
Subject References:
Authors:
Corporate Authors:
Series:
Classification:
Catalogue Information 43778 Beginning of record . Catalogue Information 43778 Top of page .

Reviews


This item has not been rated.    Add a Review and/or Rating43778
Quick Search