Linear and Nonlinear Programming
This new edition covers the central concepts of practical optimization techniques, with an emphasis on methods that are both state-of-the-art and popular. Again a connection between the purely analytical character of an optimization problem and the behavior of algorithms used to solve the problem. ...
Κύριοι συγγραφείς: | , |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Cham :
Springer International Publishing : Imprint: Springer,
2016.
|
Έκδοση: | 4th ed. 2016. |
Σειρά: | International Series in Operations Research & Management Science,
228 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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.