http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
1 online resource (xviii, 727 pages) : illustrations.
The new edition contains modifications and additions which take into account recent developments in the field. From the reviews of earlier editions: "The book is clearly written and lucidly structured. In particular, the used notations are thoroughly defined, the diverse ideas are well explained, and the results are beautifully motivated." (ZOR. Methods and Models of Operations Research). This book develops a systematic and unifying approach to the most important classes of constrained global optimization and their solution techniques. The main problem classes treated are concave minimization, reverse convex and d. c. programming, Lipschitz and continuous optimization, and systems of equations and inequalities.
Ch. I. Some Important Classes of Global Optimization Problems -- Ch. II. Outer Approximation -- Ch. III. Concavity Cut -- Ch. IV. Branch and Bound -- Ch. V. Cutting Methods -- Ch. VI. Successive Approximation Methods -- Ch. VII. Successive Partition Methods -- Ch. VIII. Decomposition of Large Scale Problems -- Ch. IX. Special Problems of Concave Minimization -- Ch. X. D. C. Programming -- Ch. XI. Lipschitz and Continuous Optimization.
Includes bibliographical references (pages [681]-718) and index.