Advances in Nonlinear Programming

1. Front Matter

   Pages i-xiii

   PDF

2. Key Note Lecture

   1. Front Matter

      Pages 1-1

      PDF

   2. The use of Band Matrices for Second Derivative Approximations in Trust Region Algorithms

      • M. J. D. Powell

      Pages 3-28

3. Invited Lectures

   1. Front Matter

      Pages 29-29

      PDF

   2. A Primal-dual Interior Method for Nonconvex Nonlinear Programming

      • David M. Gay, Michael L. Overton, Margaret H. Wright

      Pages 31-56

   3. Structure and Efficient Hessian Calculation

      • Thomas F. Coleman, Arun Verma

      Pages 57-72

   4. Piecewise Line-search Techniques for Constrained Minimization by Quasi-newton Algorithms

      • Jean Charles Gilbert

      Pages 73-103

   5. Newton-type Methods for Variational Inequalities

      • Jiye Han, Defeng Sun

      Pages 105-118

   6. Computer Solution of Linear Programs: Non-simplex Algorithms

      • J. L. Nazareth

      Pages 119-151

   7. Combining Trust Region and Line Search Techniques

      • Jorge Nocedal, Ya-xiang Yuan

      Pages 153-175

   8. SQ2P, Sequential Quadratic Constrained Quadratic Programming

      • Serge Kruk, Henry Wolkowicz

      Pages 177-204

   9. An Example of Non-Convergence of Trust Region Algorithms

      • Ya-xiang Yuan

      Pages 205-215

4. Contributed Papers

   1. Front Matter

      Pages 217-217

      PDF

   2. Combining Trust Region and Affine Scaling for Linearly Constrained Nonconvex Minimization

      • Thomas F. Coleman, Yuying Li

      Pages 219-250

   3. Some Properties of A New Conjugate Gradient Method

      • Y. H. Dai, Y. Yuan

      Pages 251-262

   4. Using Huber Method to Solve Nonlinear L ₁-Norm Problem

      • Li Gao

      Pages 263-271

   5. Robust Methods for an Inverse Heat Conduction Problem

      • Richard Lee

      Pages 273-281

   6. Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for SDP

      • Zhi-Quan Luo, Jos F. Sturm, Shuzhong Zhang

      Pages 283-297

   7. Nonlinear Programming on Networks with Discrete-Continuous Variables

      • L. A. Ostromuhov

      Pages 299-310

   8. Algorithms Guaranteeing Iterative Points within Nonnegative Orthant in Complementarity Problems

      • Hou-Duo Qi

      Pages 311-324

About 60 scientists and students attended the 96' International Conference on Nonlinear Programming, which was held September 2-5 at Institute of Compu­ tational Mathematics and Scientific/Engineering Computing (ICMSEC), Chi­ nese Academy of Sciences, Beijing, China. 25 participants were from outside China and 35 from China. The conference was to celebrate the 60's birthday of Professor M.J.D. Powell (Fellow of Royal Society, University of Cambridge) for his many contributions to nonlinear optimization. On behalf of the Chinese Academy of Sciences, vice president Professor Zhi­ hong Xu attended the opening ceremony of the conference to express his warm welcome to all the participants. After the opening ceremony, Professor M.J.D. Powell gave the keynote lecture "The use of band matrices for second derivative approximations in trust region methods". 13 other invited lectures on recent advances of nonlinear programming were given during the four day meeting: "Primal-dual methods for nonconvex optimization" by M. H. Wright (SIAM President, Bell Labs), "Interior point trajectories in semidefinite programming" by D. Goldfarb (Columbia University, Editor-in-Chief for Series A of Mathe­ matical Programming), "An approach to derivative free optimization" by A.

• algorithms
• Approximation
• computer
• derivative
• inequality
• linear optimization
• mathematics
• networks
• nonlinear optimization
• optimization
• programming

• Institute of Computational Mathematics, and Scientific/Engineering Computing, Chinese Academy of Sciences, Beijing, China

  Ya-xiang Yuan

Policies and ethics