Advances in Nonlinear Programming

Advances in Nonlinear Programming : Proceedings of the 96 International Conference on Nonlinear Programming

Edited by 

Free delivery worldwide

Available. Dispatched from the UK in 3 business days
When will my order arrive?

Description

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.
show more

Product details

  • Hardback | 353 pages
  • 162.6 x 236.2 x 27.9mm | 657.72g
  • Dordrecht, Netherlands
  • English
  • 1998 ed.
  • XIV, 353 p.
  • 0792350537
  • 9780792350538

Table of contents

Preface. Part I: Key Note Lecture. 1. The Use of Band Matrices for Second Derivative Approximations in Trust Region Algorithms; M.J.D. Powell. Part II: Invited Lectures. 2. A Primal-Dual Interior Method for Nonconvex Nonlinear Programming; D.M. Gay, et al. 3. Structure and Efficient Hessian Calculation; T.F. Coleman, A. Verma. 4. Piecewise Line-Search Techniques for Constrained Minimization by Quasi-Newton Algorithms; J.C. Gilbert. 5. Newton-Type Methods for Variational Inequalities; Jiye Han, Defeng Sun. 6. Computer Solution of Linear Programs: Non-Simplex Algorithms; J.L. Nazareth. 7. Combining Trust Region and Line Search Techniques; J. Nocedal, Ya-xiang Yuan. 8. SQ2P, Sequential Quadratic Constrained Quadratic Programming :S. Kruk, H. Wolkowicz. 9. An Example of Non-Convergence of Trust Region Algorithms; Ya-xiang Yuan. Part III: Contributed Papers. 10. Combining Trust Region and Affine Scaling for Linearly Constrained Nonconvex Minimization; T.F. Coleman, Yuying Li. 11. Some Properties of A New Conjugate Gradient Method; Y.H. Dai, Ya-xiang Yuan. 12. Using Huber Method to Solve Nonlinear L1-Norm Problem; Li Gao. 13. Robust Methods for an Inverse Heat Conduction Problem; R. Lee. 14. Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for SDP; Zhi-Quan Luo, et al. 15. Nonlinear Programming on Networks with Discrete-Continuous Variables; L.A. Ostromuhov. 16. Algorithms Guaranteeing Iterative Points within Nonnegative Orthant in Complementarity Problems; Hou-Duo Qi. 17. Globally Convergent Interior Path Following Methods for Nonlinear Programming and Brouwer Fixed Point Problems; Bo Yu, Guo-chen Feng. 18. A Further Study on a Penalty Function of Bertsekas; Liwei Zhang, Huanwen Tang.
show more