Monday, May 10
CP11
Interior-Point Methods for Nonlinear Programming I
5:30 PM-7:30 PM
Room: Capitol Center
Chair: André L. Tits, University of Maryland, College Park
- 5:30-5:45 An
Interior Point Method with a Primal-Dual Barrier Penalty Function
for Nonlinear Optimization
- Hiroshi Yabe, Science University of Tokyo, Japan; and
Hiroshi Yamashita, Mathematical Systems, Inc., Tokyo, Japan
- 5:50-6:05 A Global Path-Following Primal-Dual Interior-Point
Method for Nonlinear Programming with a Modified Augmented Lagrangian
Merit Function
- Zeferino Parada, Instituto Tecnologico Autonomo de
Mexico; and Richard A. Tapia, Rice University
- 6:10-6:25 A Primal-Dual Interior-Point Method for Nonconvex
Optimization with Multiple Logarithmic Barrier Parameters and with
Strong Convergence Properties
- Thomas J. Urban, Johns Hopkins University; André L. Tits,
and Craig T. Lawrence University of Maryland, College Park
- 6:30-6:45 A Primal-Dual Interior Point Algorithm With an Exact
Merit Function for Nonconvex Nonlinear Programming
- Ioannis Akrotirianakis and Berc Rustem, Imperial College
of Science Technology and Medicine, London, United Kingdom
- 6:50-7:05 A Computational Experience with Hessian
Approximation in a Primal-Dual Interior-Point Methods
- Amr S. El-Bakry, Rice University; P. D. Hough and Juan
C. Meza, Sandia National Laboratories; and Richard A. Tapia, Rice University
MMD Created: 12/2/98 Updated: 3/12/99