Buch, Englisch, 1046 Seiten, Format (B × H): 165 mm x 241 mm, Gewicht: 1633 g
Theory and Algorithms (Set)
Buch, Englisch, 1046 Seiten, Format (B × H): 165 mm x 241 mm, Gewicht: 1633 g
ISBN: 978-1-118-85756-4
Verlag: Wiley
Presenting recent developments of key topics in nonlinear programming, this text looks specifically at three main areas; convex analysis, optimality conditions and dual computational techniques.
Autoren/Hrsg.
Weitere Infos & Material
CONVEX ANALYSIS.
Convex Sets.
Convex Functions and Generalizations.
OPTIMALITY CONDITIONS AND DUALITY.
The Fritz John and the Karush-Kuhn-Tucker Optimality Conditions.
Constraint Qualifications.
Lagrangian Duality and Saddle Point Optimality Conditions.
ALGORITHMS AND THEIR CONVERGENCE.
The Concept of an Algorithm.
Unconstrained Optimization.
Penalty and Barrier Functions.
Methods of Feasible Directions.
Linear Complementary Problem, and Quadratic, Separable, Fractional, and Geometric Programming.
Appendices.
Bibliography.
Index.