Nonlinear Programming: Theory and Algorithms
Material type:
- 9789812530684
- 519.76 BAZ
Item type | Current library | Item location | Collection | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|---|---|
![]() |
NIMA Knowledge Centre | 7th Floor Silence Zone | Reference | 519.76 BAZ (Browse shelf(Opens below)) | Not For Loan | T0021108 | |||
![]() |
NIMA Knowledge Centre | 9th Floor Reading Zone | General | 519.76 BAZ (Browse shelf(Opens below)) | Available | T0021109 | |||
![]() |
NIMA Knowledge Centre | 9th Floor Reading Zone | General | 519.76 BAZ (Browse shelf(Opens below)) | Available | T0021110 | |||
![]() |
NIMA Knowledge Centre | 9th Floor Reading Zone | General | 519.76 BAZ (Browse shelf(Opens below)) | Available | T0021111 | |||
![]() |
NIMA Knowledge Centre | 9th Floor Reading Zone | General | 519.76 BAZ (Browse shelf(Opens below)) | Available | T0021112 |
Browsing Institute of Technology shelves, Collection: Reference Close shelf browser (Hides shelf browser)
Chapter - 1: Introduction Part - 1: Convex Analysis Chapter - 2: Convex Sets Chapter - 3: Convex Functions and Generalizations Part - 2: Optimality Conditions and Duality Chapter - 4: the Fritz and the Karush Kuhn Tucker Optimality Chapter - 5: Constraint Qualifications Chapter - 6: Lagrangian Duality and Saddle Point Optimality Conditions Part - 3: Algorithms and Their Convergence Chapter - 7: The Concept of an Algorithm Chapter - 8: Unconstrained Optimization Chapter - 9: Penalty and Barrier Functions Chapter - 10: Methods of Feasible Directions Chapter - 11: Linear Complementary Problem and Quadratic, Separable, Fractional and Geometric Programming Appendix - A: Mathematical Review Appendix - B: Summary of Convexity, Optimality Conditions and Duality
There are no comments on this title.