Nonlinear Programming 3
eBook - PDF

Nonlinear Programming 3

Proceedings of the Special Interest Group on Mathematical Programming Symposium Conducted by the Computer Sciences Department at the University of Wisconsin–Madison, July 11-13, 1977

  1. 486 pages
  2. English
  3. PDF
  4. Only available on web
eBook - PDF

Nonlinear Programming 3

Proceedings of the Special Interest Group on Mathematical Programming Symposium Conducted by the Computer Sciences Department at the University of Wisconsin–Madison, July 11-13, 1977

Book details
Table of contents
Citations

About This Book

Nonlinear Programming 3 covers the proceedings of the Special Interest Group on Mathematical Programming Symposium conducted by the Computer Sciences Department at the University of Wisconsin, Madison, on July 11-13, 1977. This book is composed of 17 chapters. The first eight chapters describe some of the most effective methods available for solving linearly and nonlinearly constrained optimization problems. The subsequent chapter gives algorithms for the solution of nonlinear equations together with computational experience. Other chapters provide some applications of optimization in operations research and a measurement procedure for optimization algorithm efficiency. These topics are followed by discussion of the methods for solving large quadratic programs and algorithms for solving stationary and fixed point problems. The last chapters consider the minimization of certain types of nondifferentiable functions and a type of Newton method. This book will prove useful to mathematicians and computer scientists.

Frequently asked questions

Simply head over to the account section in settings and click on “Cancel Subscription” - it’s as simple as that. After you cancel, your membership will stay active for the remainder of the time you’ve paid for. Learn more here.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlego’s features. The only differences are the price and subscription period: With the annual plan you’ll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access Nonlinear Programming 3 by Olvi L. Mangasarian,Robert R. Meyer,Stephen M. Robinson in PDF and/or ePUB format, as well as other popular books in Mathematik & Angewandte Mathematik. We have over one million books available in our catalogue for you to explore.

Information

Year
2014
ISBN
9781483260327

Table of contents

  1. Front Cover
  2. Nonlinear Programming 3
  3. Copyright Page
  4. Table of Contents
  5. CONTRIBUTORS
  6. PREFACE
  7. CHAPTER 1. MONOTONE OPERATORS AND AUGMENTED LAGRANGIAN METHODS IN NONLINEAR PROGRAMMING
  8. CHAPTER 2. THE CONVERGENCE OF VARIABLE METRIC METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION CALCULATIONS
  9. CHAPTER 3. A HYBRID METHOD FOR NONLINEAR PROGRAMMING
  10. CHAPTER 4. TWO-PHASE ALGORITHM FOR NONLINEAR CONSTRAINT PROBLEMS
  11. CHAPTER 5. QUASI-NEWTON METHODS FOR EQUALITY CONSTRAINED OPTIMIZATION: EQUIVALENCE OF EXISTING METHODS AND A NEW IMPLEMENTATION
  12. CHAPTER 6. AN IDEALIZED EXACT PENALTY FUNCTION
  13. CHAPTER 7. EXACT PENALTY ALGORITHMS FOR NONLINEAR PROGRAMMING
  14. CHAPTER 8. A VARIABLE METRIC METHOD FOR LINEARLY CONSTRAINED MINIMIZATION PROBLEMS
  15. CHAPTER 9. SOLVING SYSTEMS OF NONLINEAR EQUATIONS BY BROYDEN'S METHOD WITH PROJECTED UPDATES
  16. CHAPTER 10. AT THE INTERFACE OF MODELING AND ALGORITHMS RESEARCH
  17. CHAPTER 11. MODELING COMBINATORIAL MATHEMATICAL PROGRAMMING PROBLEMS BY NETFORMS: AN ILLUSTRATIVE APPLICATION
  18. CHAPTER 12. ON THE COMPARATIVE EVALUATION OF ALGORITHMS FOR MATHEMATICAL PROGRAMMING PROBLEMS
  19. CHAPTER 13. A SPECIAL CLASS OF LARGE QUADRATIC PROGRAMS
  20. CHAPTER 14. COMPUTING STATIONARY POINTS, AGAIN
  21. CHAPTER 15. A COMBINATORIAL LEMMA FOR FIXED POINT ALGORITHMS
  22. CHAPTER 16. MINIMISATION DE FONCTIONS LOCALEMENT LIPSCHITZIENNES: APPLICATIONS A LA PROGRAMMATION MI-CONVEXE, MI-DIFFERENTIABLE
  23. CHAPTER 17. A MODIFIED NEWTON ALGORITHM FOR FUNCTIONS OVER CONVEX SETS
  24. SUBJECT INDEX