Just as in its 1st edition, this book starts with illustrations of the ubiquitous character of
optimization, and describes numerical algorithms in a tutorial way. It covers fundamental …

The Barzilai and Borwein gradient method for the solution of large scale unconstrained
minimization problems is considered. This method requires few storage locations and very …

A new nonmonotone line search algorithm is proposed and analyzed. In our scheme, we
require that an average of the successive function values decreases, while the traditional …

Since I started working in the area of nonlinear programming and, later on, variational
inequality problems, I have frequently been surprised to find that many algorithms, however …

A sequential quadratic programming (SQP) algorithm generating feasible iterates is
described and analyzed. What distinguishes this algorithm from previous feasible SQP …

This text was developed from course notes written by Michael Patriksson and used over
several years at Chalmers University of Technology. The book's main focus is on providing a …

The technique of nonmonotone line search has received many successful applications and
extensions in nonlinear optimization. This paper provides some basic analyses of the …

This paper provides a review of numerical methods for the solution of smooth semi-infinite
programming problems. Fundamental and partly new results on level sets, discretization …

Successful treatment of inconsistent QP problems is of major importance in the SQP method,
since such occur quite often even for well behaved nonlinear programming problems. This …

This paper presents two new trust-region methods for solving nonlinear optimization
problems over convex feasible domains. These methods are distinguished by the fact that …