Advances in Nonlinear Programming

I Key Note Lecture.- 1 The use of band matrices for second derivative approximations in trust region algorithms.- II Invited Lectures.- 2 A Primal-Dual Interior Method for Nonconvex Nonlinear Programming.- 3 Structure and Efficient Hessian Calculation.- 4 Piecewise line-search techniques for constrained minimization by quasi-Newton algorithms.- 5 Newton-Type Methods for Variational Inequalities.- 6 Computer Solution of Linear Programs: Non-Simplex Algorithms.- 7 Combining Trust Region and Line Search Techniques.- 8 SQ2P, Sequential Quadratic Constrained Quadratic Programming.- 9 An example of non-convergence of trust region algorithms.- III Contributed Papers.- 10 Combining Trust Region and Affine Scaling for Linearly Constrained Nonconvex Minimization.- 11 Some Properties of A New Conjugate Gradient Method.- 12 Using Huber Method to solve nonlinear L1-norm Problem.- 13 Robust Methods for an Inverse Heat Conduction Problem.- 14 Superlinear Convergence of a Symmetric Primal-dual Path Following Algorithm for SDP.- 15 Nonlinear Programming on Networks with Discrete-Continuous Variables.- 16 Algorithms guaranteeing iterative points within nonnegative orthant in complementarity problems.- 17 Globally Convergent Interior Path Following Methods for Nonlinear Programming and Brouwer Fixed Point Problems.- 18 A further study on a penalty function of Bertsekas.