Linear and nonlinear programming / David G. Luenberger, Yinyu Ye
Tipo de material: TextoSeries International series in operations research & management science ; 116Detalles de publicación: New York : Springer, 2007 Edición: 3rd ed.Descripción: XIII, 546 p. : il., gráf. ; 25 cmISBN: 978-0-387-74502-2Tema(s): Programación matemática | Optimización matemáticaResumen: LIneear and Nonlinear Programming is considered a classic textbook in Optimization. While it is a classic, it also reflects modern theoretical insights. These insights provide structure to what might otherwise be simply a collection of techniques and results, and this is valuable both as a means for learning existing material and for developing new results. One major insight of this type is the connection between the purely analytical character of an optimization problem, expressed perhaps by properties of the necessary conditions, and the behavior of algorithms used to solve a problem. This was a major theme of the first and second editions. Now the third edition has been completely updated with recent Optimization Methods. The new co-author, Yinyu Ye, has written chapters and chapter material on a number of these areas including Interior Point Methods. The 1st edition of this book is considered a classic; the 2nd edition expanded on the theme, and the 3rd edition will update the material with the help of a new co-author, Yinyu YeResumen: Índice: Introduction.- Part I: Linear Programming.- 2. Basic Properties ofLinear Programs.- 3. The Simplex Method.- 4. Duality.- 5. Interior-Point Methods.- 6. Transportation and Network Flow Problems.- Part II: Unconstrained Problems.-7. Basic Descent Methods.- 8. Conjugate Direction Methods.- 9. Quasi-Newton Methods.- Part III: Constrained Minimization.- 10. Constrained Minimization Conditions.- 11. Primal Methods.- 12. Penalty and Barrier Methods.- 13. Dual and Cutting Plane Methods.- 14. Primal-Dual Methods.- Appendix A: Mathematical Review.- A.1. Sets.- A.2. Matrix Notation.- A.3. Spaces.- A.4. Eigenvalues a... Etc.Tipo de ítem | Biblioteca de origen | Signatura | URL | Estado | Fecha de vencimiento | Código de barras | Reserva de ítems |
---|---|---|---|---|---|---|---|
Monografías | 02. BIBLIOTECA CAMPUS PUERTO REAL | 519.85/LUE/lin (Navegar estantería(Abre debajo)) | Texto completo | Disponible Ubicación en estantería | Bibliomaps® | 3742944647 | ||
Monografías | 02. BIBLIOTECA CAMPUS PUERTO REAL | 519.85/LUE/lin (Navegar estantería(Abre debajo)) | Texto completo | Prestado | 02/01/2015 | 3743211877 |
Índice
Bibliografía: p. 527-539
LIneear and Nonlinear Programming is considered a classic textbook in Optimization. While it is a classic, it also reflects modern theoretical insights. These insights provide structure to what might otherwise be simply a collection of techniques and results, and this is valuable both as a means for learning existing material and for developing new results. One major insight of this type is the connection between the purely analytical character of an optimization problem, expressed perhaps by properties of the necessary conditions, and the behavior of algorithms used to solve a problem. This was a major theme of the first and second editions. Now the third edition has been completely updated with recent Optimization Methods. The new co-author, Yinyu Ye, has written chapters and chapter material on a number of these areas including Interior Point Methods. The 1st edition of this book is considered a classic; the 2nd edition expanded on the theme, and the 3rd edition will update the material with the help of a new co-author, Yinyu Ye
Índice: Introduction.- Part I: Linear Programming.- 2. Basic Properties ofLinear Programs.- 3. The Simplex Method.- 4. Duality.- 5. Interior-Point Methods.- 6. Transportation and Network Flow Problems.- Part II: Unconstrained Problems.-7. Basic Descent Methods.- 8. Conjugate Direction Methods.- 9. Quasi-Newton Methods.- Part III: Constrained Minimization.- 10. Constrained Minimization Conditions.- 11. Primal Methods.- 12. Penalty and Barrier Methods.- 13. Dual and Cutting Plane Methods.- 14. Primal-Dual Methods.- Appendix A: Mathematical Review.- A.1. Sets.- A.2. Matrix Notation.- A.3. Spaces.- A.4. Eigenvalues a... Etc.
No hay comentarios en este titulo.