Nonlinear programming : theory, algorithms, and applications
Author(s)
Bibliographic Information
Nonlinear programming : theory, algorithms, and applications
Wiley, c1983
Available at 37 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
"A Wiley-Interscience publication."
Includes bibliographical references and index
Description and Table of Contents
Table of Contents
BASICS. The Nature of Optimization Problems. Analytical Background. Factorable Functions. UNCONSTRAINED PROBLEMS. Unconstrained Optimization Models. Minimizing a Function of a Single Variable. General Convergence Theory for Unconstrained Minimization Algorithms. Newton's Method With Variations. Conjugate Direction Algorithms. Quasi-Newton Methods. OPTIMALITY CONDITIONS FOR CONSTRAINED PROBLEMS. First- and Second-Order Optimality Conditions. Applications of Optimality Conditions. LINEARLY CONSTRAINED PROBLEMS. Models with Linear Constraints. Variable-Reduction Algorithms. NONLINEARLY CONSTRAINED PROBLEMS. Models with Nonlinear Constraints. Direct Algorithms for Nonlinearly Constrained Problems. Sequential Unconstrained Minimization Techniques. Sequential Constraint Linearization Techniques. OTHER TOPICS. Obtaining Global Solutions. Geometric Programming. References. Author and Subject Indexes.
by "Nielsen BookData"