Secure CheckoutPersonal information is secured with SSL technology.
Free ShippingFree global shipping
No minimum order.
Nonlinear Programming 2 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 April 15-17, 1974. This book is divided into 13 chapters and begins with a survey of the global and superlinear convergence of a class of algorithms obtained by imposing changing bounds on the variables of the problem. The succeeding chapters deal with the convergence of the well-known reduced gradient method under suitable conditions and a superlinearly convergent quasi-Newton method for unconstrained minimization. These topics are followed by discussion of a superlinearly convergent algorithm for linearly constrained optimization problems and the effective methods for constrained optimization, namely the method of augmented Lagrangians. Other chapters explore a method for handling minimization problems with discontinuous derivatives and the advantages of factorizations of updating for Jacobian-related matrices in minimization problems. The last chapters present the Newton-like methods for the solution of nonlinear equations and inequalities, along with the various aspects of integer programming. This book will prove useful to mathematicians and computer scientists.
Convergence Properties of a Class of Minimization Algorithms
Convergence of the Reduced Gradient Method
A Quasi-Newton Method for Unconstrained Minimization Problems
Superlinearly Convergent Algorithms for Linearly Constrained Optimization
An Ideal Penalty Function for Constrained Optimization
On Penalty and Multiplier Methods for Constrained Minimization
Rate of Convergence of the Method of Multipliers with Inexact Minimization
Optimization with Corners
The Use of Matrix Factorizations in Derivative-Free Nonlinear Least Squares Algorithms
Newton Derived Methods for Nonlinear Equations and Inequalities
Disjunctive Programming: Cutting Planes from Logical Conditions
A Generalization of a Theorem of Chvátal and Gomory
Zero-One Zero-One Programming and Enumeration
- No. of pages:
- © Academic Press 1975
- 28th January 1975
- Academic Press
- eBook ISBN:
Elsevier.com visitor survey
We are always looking for ways to improve customer experience on Elsevier.com.
We would like to ask you for a moment of your time to fill in a short questionnaire, at the end of your visit.
If you decide to participate, a new browser tab will open so you can complete the survey after you have completed your visit to this website.
Thanks in advance for your time.