Nonlinear programming, 2: proceedings of the Special Interest Group on Mathematical Programming symposium, conducted by the Computer Sciences Department at the University of Wisconsin--Madison, April 15-17, 1974

Front Cover
Academic Press, 1975 - Mathematics - 361 pages
0 Reviews
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.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.


Convergence of the Reduced Gradient Method
A QuasiNewton Method for Unconstrained Minimization Problems
Superlinearly Convergent Algorithms for Linearly Constrained Optimization

10 other sections not shown

Common terms and phrases

Bibliographic information