A01=Leonard D. Berkovitz
algorithms
analysis
Author_Leonard D. Berkovitz
basis
book
Category=PBU
comprehensive
constrained
convexity
dimensional
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
finite
general
introduction
mathematical
mathematics
numerical
optimization
problems
rn
solution
study
Product details
- ISBN 9780471352815
- Weight: 599g
- Dimensions: 161 x 240mm
- Publication Date: 29 Jan 2002
- Publisher: John Wiley & Sons Inc
- Publication City/Country: US
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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.
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.
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.
