
Convexity and Optimization in R-N
2003
John Wiley & Sons Inc (Hersteller)
978-0-471-24970-2 (ISBN)
John Wiley & Sons Inc (Hersteller)
978-0-471-24970-2 (ISBN)
- Keine Verlagsinformationen verfügbar
- Artikel merken
Presents the mathematics of finite dimensional constrained optimization problems. This book offers a presentation of real analysis. It provides a basis for the mathematical study of convexity, of more general optimization problems, and of numerical algorithms; for the solution of finite dimensional optimization problems.
This book presents the mathematics of finite dimensional constrained optimization problems. It offers a solid presentation of real analysis and provides a basis for the mathematical study of convexity, of more general optimization problems, and of numerical algorithms for the solution of finite dimensional optimization problems.
This book presents the mathematics of finite dimensional constrained optimization problems. It offers a solid presentation of real analysis and provides a basis for the mathematical study of convexity, of more general optimization problems, and of numerical algorithms for the solution of finite dimensional optimization problems.
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.
Erscheint lt. Verlag | 1.4.2003 |
---|---|
Zusatzinfo | Illustrations |
Verlagsort | New York |
Sprache | englisch |
Themenwelt | Mathematik / Informatik ► Mathematik |
ISBN-10 | 0-471-24970-X / 047124970X |
ISBN-13 | 978-0-471-24970-2 / 9780471249702 |
Zustand | Neuware |
Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
Haben Sie eine Frage zum Produkt? |