Convex Analysis and Minimization Algorithms I (inbunden)
Fler böcker inom
Format
Inbunden (Hardback)
Språk
Engelska
Antal sidor
418
Utgivningsdatum
1993-10-01
Upplaga
1st ed. 1993. 2nd corr. printing 1996
Förlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Medarbetare
Berger, M. (red.)
Illustratör/Fotograf
113 Abb
Illustrationer
XVIII, 418 p.
Volymtitel
Part 1 Convex Analysis and Minimization Algorithms I Fundamentals
Dimensioner
239 x 165 x 29 mm
Vikt
781 g
Antal komponenter
1
Komponenter
1 Hardback
ISBN
9783540568506

Convex Analysis and Minimization Algorithms I

Fundamentals

av Jean-Baptiste Hiriart-Urruty, Claude Lemarechal
Inbunden,  Engelska, 1993-10-01
1837
Köp
Spara som favorit
  • Skickas från oss inom 7-10 vardagar.
  • Fri frakt över 249 kr för privatkunder i Sverige.
Finns även som
Visa alla 2 format & utgåvor
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.
Visa hela texten

Passar bra ihop

  1. Convex Analysis and Minimization Algorithms I
  2. +
  3. The Anxious Generation

De som köpt den här boken har ofta också köpt The Anxious Generation av Jonathan Haidt (inbunden).

Köp båda 2 för 2126 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av författarna

Jean-Baptiste Hiriart-Urruty, Claude Lemarechal

Recensioner i media

From the reviews: "... The book is very well written, nicely illustrated, and clearly understandable even for senior undergraduate students of mathematics... Throughout the book, the authors carefully follow the recommendation by A. Einstein: 'Everything should be made as simple as possible, but not simpler.'"

Innehållsförteckning

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 Birds Eye View of Measure Theory and Integration.- Bibliographical Comments.- References.

Du kanske gillar