Convexity and Optimization in Rn - Hardcover

Berkovitz, Leonard D.

Hardcover

ISBN 10: 0471352810 ISBN 13: 9780471352815

Publisher: Wiley-Interscience, 2001

Synopsis

A comprehensive introduction to convexity and optimization inRn

This book presents the mathematics of finite dimensionalconstrained optimization problems. It provides a basis for thefurther mathematical study of convexity, of more generaloptimization problems, and of numerical algorithms for the solutionof finite dimensional optimization problems. For readers who do nothave the requisite background in real analysis, the author providesa chapter covering this material. The text features abundantexercises and problems designed to lead the reader to a fundamentalunderstanding of the material.

Convexity and Optimization in Rn provides detailed discussionof:
* Requisite topics in real analysis
* Convex sets
* Convex functions
* Optimization problems
* Convex programming and duality
* The simplex method

A detailed bibliography is included for further study and an indexoffers quick reference. Suitable as a text for both graduate andundergraduate students in mathematics and engineering, thisaccessible text is written from extensively class-tested notes.

About this title

About the Author

LEONARD D. BERKOVITZ, PhD, is Professor of Mathematics at Purdue University. He previously worked at the RAND Corporation and has served on the editorial boards of several journals, including terms as Managing Editor of the SIAM Journal on Control and as a member of the Editorial Committee of Mathematical Reviews.

From the Back Cover

A comprehensive introduction to convexity and optimization in Rn

This book presents the mathematics of finite dimensional constrained optimization problems. It provides a basis for the further mathematical study of convexity, of more general optimization problems, and of numerical algorithms for the solution of finite dimensional optimization problems. For readers who do not have the requisite background in real analysis, the author provides a chapter covering this material. The text features abundant exercises and problems designed to lead the reader to a fundamental understanding of the material.

Convexity and Optimization in Rn provides detailed discussion of:

• Requisite topics in real analysis
• Convex sets
• Convex functions
• Optimization problems
• Convex programming and duality
• The simplex method

A detailed bibliography is included for further study and an index offers quick reference. Suitable as a text for both graduate and undergraduate students in mathematics and engineering, this accessible text is written from extensively class-tested notes.

This book presents the mathematics of finite dimensional constrained optimization problems. It provides a basis for the further mathematical study of convexity, of more general optimization problems, and of numerical algorithms for the solution of finite dimensional optimization problems. For readers who do not have the requisite background in real analysis, the author provides a chapter covering this material. The text features abundant exercises and problems designed to lead the reader to a fundamental understanding of the material.

Convexity and Optimization in Rn provides detailed discussion of:

• Requisite topics in real analysis
• Convex sets
• Convex functions
• Optimization problems
• Convex programming and duality
• The simplex method

A detailed bibliography is included for further study and an index offers quick reference. Suitable as a text for both graduate and undergraduate students in mathematics and engineering, this accessible text is written from extensively class-tested notes.

Edition details

• Publisher: Wiley-Interscience
• Publication date: 2001
• Language: English
• ISBN 10: 0471352810
• ISBN 13: 9780471352815
• Binding: Hardcover
• Edition number: 1
• Number of pages: 280