Algorithms for Continuous Optimization

Algorithms for Continuous Optimization : The State of the Art

List price: US$109.98

Currently unavailable

We can notify you when this item is back in stock

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


The NATO Advanced Study Institute on "Algorithms for continuous optimiza- tion: the state of the art" was held September 5-18, 1993, at II Ciocco, Barga, Italy. It was attended by 75 students (among them many well known specialists in optimiza- tion) from the following countries: Belgium, Brasil, Canada, China, Czech Republic, France, Germany, Greece, Hungary, Italy, Poland, Portugal, Rumania, Spain, Turkey, UK, USA, Venezuela. The lectures were given by 17 well known specialists in the field, from Brasil, China, Germany, Italy, Portugal, Russia, Sweden, UK, USA. Solving continuous optimization problems is a fundamental task in computational mathematics for applications in areas of engineering, economics, chemistry, biology and so on. Most real problems are nonlinear and can be of quite large size. Devel- oping efficient algorithms for continuous optimization has been an important field of research in the last 30 years, with much additional impetus provided in the last decade by the availability of very fast and parallel computers. Techniques, like the simplex method, that were already considered fully developed thirty years ago have been thoroughly revised and enormously improved. The aim of this ASI was to present the state of the art in this field. While not all important aspects could be covered in the fifty hours of lectures (for instance multiob- jective optimization had to be skipped), we believe that most important topics were presented, many of them by scientists who greatly contributed to their development.
show more

Product details

  • Hardback | 565 pages
  • 160 x 240 x 35.05mm | 997g
  • Dordrecht, Netherlands
  • English
  • 1994 ed.
  • XV, 565 p.
  • 0792328590
  • 9780792328599

Table of contents

Preface. 1. General Optimality Conditions via a Separation Scheme; F. Giannessi. 2. Linear Equations in Optimization; C.G. Broyden. 3. Generalized and Sparse Least Squares Problems; A. Bjoerck. 4. Algorithms for Solving Nonlinear Systems of Equations; J.M. Martinez. 5. An Overview of Unconstrained Optimization; R. Fletcher. 6. Nonquadratic Model Methods in Unconstrained Optimization; Naiyang Deng, Zhengfeng Li. 7. Algorithms for General Constrained Nonlinear Optimization; M.C. Bartholomew-Biggs. 8. Exact Penalty Methods; G. Di Pillo. 9. Stable Barrier-Projection and Barrier-Newton Methods for Linear and Nonlinear Programming; Y.G. Evtushenko, V.G. Zhadan. 10. Large-Scale Nonlinear Constrained Optimization: a Current Survey; A.R. Conn, N. Gould, P.L. Toint. 11. ABS Methods for Nonlinear Optimization; E. Spedicato, Zunquan Xia. 12. A Condensed Introduction to Bundle Methods in Nonsmooth Optimization; C. Lemarechal, J. Zowe. 13. Computational Methods for Linear Programming; D.F. Shanno. 14. Infeasible Interior Point Methods for Solving Linear Programs; J. Stoer. 15. Algorithms for Linear Complementarity Problems; J.J. Judice. 16. A Homework Exercise -- the `Big M' Problem; R.W.H. Sargent. 17. Deterministic Global Optimization; Y.G. Evtushenko, M.A. Potapov. 18. On Automatic Differentiation and Continuous Optimization; L.C.W. Dixon. 19. Neural Networks and Unconstrained Optimization;L.C.W. Dixon. 20. Parallel Nonlinear Optimization: Limitations, Challenges and Opportunities; R.B. Schnabel. 21. Index.
show more