Paperback(Softcover reprint of the original 4th ed. 2016)
-
SHIP THIS ITEMNot Eligible for Free ShippingPICK UP IN STORECheck Availability at Nearby Stores
Available within 2 business hours
Related collections and offers
Overview
New to this edition is a chapter devoted to Conic Linear Programming, a powerful generalization of Linear Programming. Indeed, many conic structures are possible and useful in a variety of applications. It must be recognized, however, that conic linear programming is an advanced topic, requiring special study. Another important topic is an accelerated steepest descent method that exhibits superior convergence properties, and for this reason, has become quite popular. The proof of the convergence property for both standard and accelerated steepest descent methods are presented in Chapter 8. As in previous editions, end-of-chapter exercises appear for all chapters.
From the reviews of the Third Edition:
“… this very well-written book is a classic textbook in Optimization. It should be present in the bookcase of each student, researcher, and specialist from the host of disciplines from which practical optimization applications are drawn.” (Jean-Jacques Strodiot, Zentralblatt MATH, Vol. 1207, 2011)
Product Details
ISBN-13: | 9783319374390 |
---|---|
Publisher: | Springer International Publishing |
Publication date: | 08/14/2015 |
Series: | International Series in Operations Research & Management Science , #228 |
Edition description: | Softcover reprint of the original 4th ed. 2016 |
Pages: | 546 |
Product dimensions: | 6.10(w) x 9.25(h) x 0.04(d) |
About the Author
He served as Technical Assistant to the President’s Science Advisor in 1971-72, was Guest Professor at the Technical University of Denmark (1986), Visiting Professor of the Massachusetts Institute of Technology (1976), and served as Department Chairman at Stanford (1980-1991).
His awards include: Member of the National Academy of Engineering (2008), the Bode Lecture Prize of the Control Systems Society (1990), the Oldenburger Medal of the American Society of Mechanical Engineers (1995), and the Expository Writing Award of the Institute of Operations Research and Management Science (1999). He is a Fellow of the Institute of Electrical and Electronic Engineers (since 1975).
Yinyu Ye is currently the Kwoh-Ting Li Professor in the School of Engineering at the Department of Management Science and Engineering and Institute of Computational and Mathematical Engineering and the Director of the MS&E Industrial Affiliates Program, Stanford University. He received the B.S. degree in System Engineering from the Huazhong University of Science and Technology, China, and the M.S. and Ph.D. degrees in Engineering-Economic Systems and Operations Research from Stanford University.
Ye's research interests lie in the areas of optimization, complexity theory, algorithm design and analysis, and applications of mathematical programming, operations research and system engineering. He is also interested in developing optimization software for various real-world applications. Current research topics include Liner Programming Algorithms, Markov Decision Processes, Computational Game/Market Equilibrium, Metric Distance Geometry, Dynamic Resource Allocation, and Shastic and Robust Decision Making, etc. He is an INFORMS (The Institute for Operations Research and The Management Science) Fellow, and has received several research awards including the inaugural 2012 ISMP Tseng Lectureship Prize for outstanding contribution to continuous optimization, the 2009 John von Neumann Theory Prize for fundamental sustained contributions to theory in Operations Research and the Management Sciences, the inaugural 2006 Farkas prize on Optimization, and the 2009 IBM Faculty Award.
Table of Contents
Introduction.- Part I Linear Programming.- Basic Properties of Linear Programs.- The Simplex Method.- Duality and Complementarity.- Interior-Point Methods.- Conic Linear Programming.- Part II Unconstrained Problems.- Basic Properties of Solutions and Algorithms.- Basic Descent Methods.- Conjugate Direction Methods.- Quasi-Newton Methods.- Part III Constrained Minimization.- Constrained Minimization Conditions.- Primal Methods.- Penalty and Barrier Methods.- Duality and Dual Methods.- Primal-Dual Methods.- Appendix A: Mathematical Review.- Appendix B: Convex Sets.- Appendix C: Gaussian Elimination.- Appendix D: Basic Network Concepts.What People are Saying About This
I have the 1977 edition from my father's MIT days. I am a Mathematician and I can verify that the book written in 1977 is of the same style that good books have today. A book is not made obsolete because some new "elegant" terms arise.
I have profitably used the book to apply constrained minimization procedures in the field of computational contact mechanics. I think it is not a secret that quite often books on mathematics are written from mathematicians for mathematicians. Hence it is quite hard for engineers to read and to extract valuable information from them. With this respect this book is a shining star. It presents the topics in a very precise but clear and understandable way. (Turin, Italy)