Nonlinear programming: theory and algorithms (Record no. 311)

MARC details
000 -LEADER
fixed length control field 04815nam a22002177a 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20190924191440.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 190831b ||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9788126567881
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 519.76
Item number BAZ
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Bazaraa, Mokhtar S.
245 ## - TITLE STATEMENT
Title Nonlinear programming: theory and algorithms
250 ## - EDITION STATEMENT
Edition statement 3rd
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Name of publisher, distributor, etc. Wiley India Pvt. Ltd.
Place of publication, distribution, etc. New Delhi
Date of publication, distribution, etc. 2017
300 ## - PHYSICAL DESCRIPTION
Extent 853 p.
365 ## - TRADE PRICE
Price type code INR
Price amount 1245.00
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Table of Content<br/><br/>Chapter 1 Introduction.<br/><br/>1.1 Problem Statement and Basic Definitions.<br/><br/>1.2 Illustrative Examples.<br/><br/>1.3 Guidelines for Model Construction.<br/><br/> <br/><br/>Part 1 Convex Analysis.<br/><br/>Chapter 2 Convex Sets.<br/><br/>2.1 Convex Hulls.<br/><br/>2.2 Closure and Interior of a Set.<br/><br/>2.3 Weierstrass's Theorem.<br/><br/>2.4 Separation and Support of Sets.<br/><br/>2.5 Convex Cones and Polarity.<br/><br/>2.6 Polyhedral Sets, Extreme Points and Extreme Directions.<br/><br/>2.7 Linear Programming and the Simplex Method.<br/><br/> <br/><br/>Chapter 3 Convex Functions and Generalizations.<br/><br/>3.1 Definitions and Basic Properties.<br/><br/>3.2 Subgradients of Convex Functions.<br/><br/>3.3 Differentiable Convex Functions.<br/><br/>3.4 Minima and Maxima of Convex Functions.<br/><br/>3.5 Generalizations of Convex Functions.<br/><br/> <br/><br/>Part 2 Optimality Conditions and Duality.<br/><br/>Chapter 4 The Fritz John and Karush-Kuhn-Tucker Optimality Conditions.<br/><br/>4.1 Unconstrained Problems.<br/><br/>4.2 Problems Having Inequality Constraints.<br/><br/>4.3 Problems Having Inequality and Equality Constraints.<br/><br/>4.4 Second-Order Necessary and Sufficient Optimality Conditions for Constrained Problems.<br/><br/> <br/><br/>Chapter 5 Constraint Qualifications.<br/><br/>5.1 Cone of Tangents.<br/><br/>5.2 Other Constraint Qualifications.<br/><br/>5.3 Problems Having Inequality and Equality Constraints.<br/><br/> <br/><br/>Chapter 6 Lagrangian Duality and Saddle Point Optimality Conditions.<br/><br/>6.1 Lagrangian Dual Problem.<br/><br/>6.2 Duality Theorems and Saddle Point Optimality Conditions.<br/><br/>6.3 Properties of the Dual Function.<br/><br/>6.4 Formulating and Solving the Dual Problem<br/><br/>6.5 Getting the Primal Solution.<br/><br/>6.6 Linear and Quadratic Programs.<br/><br/> <br/><br/>Part 3 Algorithms and Their Convergence.<br/><br/>Chapter 7 The Concept of an Algorithm.<br/><br/>7.1 Algorithms and Algorithmic Maps.<br/><br/>7.2 Closed Maps and Convergence.<br/><br/>7.3 Composition of Mappings.<br/><br/>7.4 Comparison Among Algorithms.<br/><br/> <br/><br/>Chapter 8 Unconstrained Optimization.<br/><br/>8.1 Line Search Without Using Derivatives.<br/><br/>8.2 Line Search Using Derivatives.<br/><br/>8.3 Some Practical Line Search Methods.<br/><br/>8.4 Closedness of the Line Search Algorithmic Map.<br/><br/>8.5 Multidimensional Search Without Using Derivatives.<br/><br/>8.6 Multidimensional Search Using Derivatives.<br/><br/>8.7 Modification of Newton's Method: Levenberg-Marquardt and Trust Region Methods.<br/><br/>8.8 Methods Using Conjugate Directions: Quasi-Newton and Conjugate Gradient Methods.<br/><br/>8.9 Subgradient Optimization Methods.<br/><br/> <br/><br/>Chapter 9 Penalty and Barrier Functions.<br/><br/>9.1 Concept of Penalty Functions.<br/><br/>9.2 Exterior Penalty Function Methods.<br/><br/>9.3 Exact Absolute Value and Augmented Lagrangian Penalty Methods.<br/><br/>9.4 Barrier Function Methods.<br/><br/>9.5 Polynomial-Time Interior Point Algorithms for Linear Programming Based on a Barrier Function.<br/><br/> <br/><br/>Chapter 10 Methods of Feasible Directions.<br/><br/>10.1 Method of Zoutendijk.<br/><br/>10.2 Convergence Analysis of the Method of Zoutendijk.<br/><br/>10.3 Successive Linear Programming Approach.<br/><br/>10.4 Successive Quadratic Programming or Projected Lagrangian Approach.<br/><br/>10.5 Gradient Projection Method of Rosen.<br/><br/>10.6 Reduced Gradient Method of Wolfe and Generalized Reduced Gradient Method.<br/><br/>10.7 Convex-Simplex Method of Zangwill.<br/><br/>10.8 Effective First- and Second-Order Variants of the Reduced Gradient Method.<br/><br/> <br/><br/>Chapter 11 Linear Complementary Problem, and Quadratic, Separable, Fractional, and Geometric Programming.<br/><br/>11.1 Linear Complementary Problem.<br/><br/>11.2 Convex and Nonconvex Quadratic Programming: Global Optimization Approaches.<br/><br/>11.3 Separable Programming.<br/><br/>11.4 Linear Fractional Programming.<br/><br/>11.5 Geometric Programming.<br/><br/> <br/><br/>Exercises.<br/><br/>Notes and References.<br/><br/>Appendix A Mathematical Review.<br/><br/>Appendix B Summary of Convexity, Optimality Conditions, and Duality.<br/><br/>Bibliography.<br/><br/>Index.
520 ## - SUMMARY, ETC.
Summary, etc. This book presents recent developments of key topics in nonlinear programming (NLP) using a logical and self-contained format. The volume is divided into three sections: convex analysis, optimality conditions, and dual computational techniques. Precise statements of algortihms are given along with convergence analysis. Each chapter contains detailed numerical examples, graphical illustrations, and numerous exercises to aid readers in understanding the concepts and methods discussed.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Nonlinear programming
700 ## - ADDED ENTRY--PERSONAL NAME
Personal name Shetty, C. M.
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
Koha item type Book
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Bill No Bill Date Home library Current library Shelving location Date acquired Source of acquisition Cost, normal purchase price Total Checkouts Total Renewals Full call number Accession Number Date last seen Date checked out Copy number Cost, replacement price Price effective from Koha item type
    Dewey Decimal Classification     Operations Management & Quantitative Techniques IN28349 22-05-2019 Indian Institute of Management LRC Indian Institute of Management LRC General Stacks 06/17/2019 Overseas Press India Private 932.50 4 1 519.76 BAZ 000590 07/04/2023 06/15/2023 1 1245.00 08/31/2019 Book

©2019-2020 Learning Resource Centre, Indian Institute of Management Bodhgaya

Powered by Koha