Skip to Main Content

Bulletin of the American Mathematical Society

The Bulletin publishes expository articles on contemporary mathematical research, written in a way that gives insight to mathematicians who may not be experts in the particular topic. The Bulletin also publishes reviews of selected books in mathematics and short articles in the Mathematical Perspectives section, both by invitation only.

ISSN 1088-9485 (online) ISSN 0273-0979 (print)

The 2020 MCQ for Bulletin of the American Mathematical Society is 0.84.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Book Review

The AMS does not provide abstracts of book reviews. You may download the entire review from the links below.


MathSciNet review: 1566960
Full text of review: PDF   This review is available free of charge.
Book Information:

Author: Magnus R. Hestenes
Title: Optimization theory, the finite dimensional case
Additional book information: John Wiley and Sons, New York, London, Sydney, Toronto, 1975, xiii + 447 pp., $24.95.

References [Enhancements On Off] (What's this?)

  • K. J. Arrow, F. J. Gould, and S. M. Howe, A general saddle point result for constrained optimization, Math. Programming 5 (1973), 225–234. MR 329641, DOI 10.1007/BF01580123
  • Kenneth J. Arrow, Leonid Hurwicz, and Hirofumi Uzawa, Studies in linear and non-linear programming, Stanford Mathematical Studies in the Social Sciences, II, Stanford University Press, Stanford, Calif., 1958. With contributions by H. B. Chenery, S. M. Johnson, S. Karlin, T. Marschak, R. M. Solow. MR 0108399
  • R. J. Duffin, Linearizing geometric programs, SIAM Rev. 12 (1970), 211–227. MR 286493, DOI 10.1137/1012043
  • Richard J. Duffin, Elmor L. Peterson, and Clarence Zener, Geometric programming: Theory and application, John Wiley & Sons, Inc., New York-London-Sydney, 1967. MR 0214374
  • B. Curtis Eaves and Herbert Scarf, The solution of systems of piecewise linear equations, Math. Oper. Res. 1 (1976), no. 1, 1–27. MR 445792, DOI 10.1287/moor.1.1.1
  • Hugh Everett III, Generalized Lagrange multiplier method for solving problems of optimum allocation of resources, Operations Res. 11 (1963), 399–417. MR 152360, DOI 10.1287/opre.11.3.399
  • Anthony V. Fiacco and Garth P. McCormick, Nonlinear programming: Sequential unconstrained minimization techniques, John Wiley & Sons, Inc., New York-London-Sydney, 1968. MR 0243831
  • F. J. Gould, Extensions of Lagrange multipliers in nonlinear programming, SIAM J. Appl. Math. 17 (1969), 1280–1297. MR 263426, DOI 10.1137/0117120
  • F. J. Gould and Jon W. Tolle, A necessary and sufficient qualification for constrained optimization, SIAM J. Appl. Math. 20 (1971), 164–172. MR 303954, DOI 10.1137/0120021
  • F. J. Gould and J. W. Tolle, A unified approach to complementarity in optimization, Discrete Math. 7 (1974), 225–271. MR 334926, DOI 10.1016/0012-365X(74)90037-5
  • P. C. Haarhoff and J. D. Buys, A new method for the optimization of a nonlinear function subject to nonlinear constraints, Comput. J. 13 (1970), 178–184. MR 277095, DOI 10.1093/comjnl/13.2.178
  • Magnus R. Hestenes, Multiplier and gradient methods, Computing Methods in Optimization Problems, 2 (Proc. Conf., San Remo, 1968) Academic Press, New York, 1969, pp. 143–163. MR 0262903
  • Magnus R. Hestenes, Multiplier and gradient methods, J. Optim. Theory Appl. 4 (1969), 303–320. MR 271809, DOI 10.1007/BF00927673
  • T. L. Magnanti, Fenchel and Lagrange duality are equivalent, Math. Programming 7 (1974), 253–258. MR 368771, DOI 10.1007/BF01585523
  • O. L. Mangasarian, Unconstrained Lagrangians in nonlinear programming, SIAM J. Control 13 (1975), 772–791. MR 0373626
    • 16.
    O. L. Mangasarian, Nonlinear programming theory and computation, Handbook of Operations Research, Chapter 6 (Elmaghraby and Moder, editors), van Nostrand Reinhold, New York, 1973.
  • E. Blum and W. Oettli, Mathematische Optimierung, Ökonometrie und Unternehmensforschung, Band XX, Springer-Verlag, Berlin-New York, 1975. Grundlagen und Verfahren; Mit einem Anhang “Bibliographie zur Nichtlinearer Programmierung”. MR 0418921
  • J. M. Ortega and W. C. Rheinboldt, Iterative solution of nonlinear equations in several variables, Academic Press, New York-London, 1970. MR 0273810
  • M. J. D. Powell, A method for nonlinear constraints in minimization problems, Optimization (Sympos., Univ. Keele, Keele, 1968) Academic Press, London, 1969, pp. 283–298. MR 0272403
  • M. J. D. Powell, A view of unconstrained optimization, Optimization in action (Proc. Conf., Univ. Bristol, Bristol, 1975) Academic Press, London, 1976, pp. 117–152. MR 0431680
  • R. Tyrrell Rockafellar, Convex analysis, Princeton Mathematical Series, No. 28, Princeton University Press, Princeton, N.J., 1970. MR 0274683
  • R. Tyrrell Rockafellar, Augmented Lagrange multiplier functions and duality in nonconvex programming, SIAM J. Control 12 (1974), 268–285. Collection of articles dedicated to the memory of Lucien W. Neustadt. MR 0384163
  • R. Tyrrell Rockafellar, A dual approach to solving nonlinear programming problems by unconstrained optimization, Math. Programming 5 (1973), 354–373. MR 371416, DOI 10.1007/BF01580138
  • Josef Stoer and Christoph Witzgall, Convexity and optimization in finite dimensions. I, Die Grundlehren der mathematischen Wissenschaften, Band 163, Springer-Verlag, New York-Berlin, 1970. MR 0286498
  • Philip Wolfe, A method of conjugate subgradients for minimizing nondifferentiable functions, Math. Programming Stud. 3 (1975), 145–173. Nondifferentiable optimization. MR 448896, DOI 10.1007/bfb0120703
    •
    Review Information:

    Reviewer: Robert G. Jeroslow
    Journal: Bull. Amer. Math. Soc. 83 (1977), 324-335
    DOI: https://doi.org/10.1090/S0002-9904-1977-14252-3