Nonlinear programming : proceedings of the Special Interest Group on Mathematical Programming symposium .... 2 (1975). Proceedings of the Special Interest Group on Mathematical Programming symposium, conducted by the Computer Sciences Department at the Un

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. Content: Front Matter, Page iii Copyright, Page iv CONTRIBUTORS, Page vii PREFACE, Page ix, O.L. Mangasarian, R.R. Meyer, S.M. Robinson CONVERGENCE PROPERTIES OF A CLASS OF MINIMIZATION ALGORITHMS, Pages 1-27, M.J.D. Powell CONVERGENCE OF THE REDUCED GRADIENT METHOD, Pages 29-54, Pierre Huard A QUASI-NEWTON METHOD FOR UNCONSTRAINED MINIMIZATION PROBLEMS, Pages 55-100, Klaus Ritter SUPERLINEARLY CONVERGENT ALGORITHMS FOR LINEARLY CONSTRAINED OPTIMIZATION PROBLEMS, Pages 101-119, U.M. García-Palomares AN IDEAL PENALTY FUNCTION FOR CONSTRAINED OPTIMIZATION, Pages 121-163, R. Fletcher ON PENALTY AND MULTIPLIER METHODS FOR CONSTRAINED MINIMIZATION, Pages 165-191, Dimitri P. Bertsekas RATE OF CONVERGENCE OF THE METHOD OF MULTIPLIERS WITH INEXACT MINIMIZATION, Pages 193-214, Barry W. Kort OPTIMIZATION WITH CORNERS, Pages 215-230, A.A. Goldstein THE USE OF MATRIX FACTORIZATIONS IN DERIVATIVE-FREE NONLINEAR LEAST SQUARES ALGORITHMS, Pages 231-253, Richard H. Bartels NEWTON DERIVED METHODS FOR NONLINEAR EQUATIONS AND INEQUALITIES, Pages 255-277, E. Polak, I. Teodoru DISJUNCTIVE PROGRAMMING: CUTTING PLANES FROM LOGICAL CONDITIONS, Pages 279-312, Egon Balas A GENERALIZATION OF A THEOREM OF CHVÁTAL AND GOMORY, Pages 313-331, R.G. Jeroslow ZERO-ONE ZERO-ONE PROGRAMMING AND ENUMERATION, Pages 333-360, Monique Guignard, Kurt Spielberg SUBJECT INDEX, Page 361 Edited By O. L. Mangasarian, R. R. Meyer, S. M. Robinson. Includes Bibliographies And Index.