Monday, May 20
10:00 AM-12:00 PM
Salon A
MS5
Interior Point Methods
(Invited minisymposium)
In the last ten years, interior point methods have been studied extensively and
intensively, and a remarkable progress has been made. In particular, it has become
one of the most important tools for solving large scale optimization problems. In this
minisymposium, the speakers will present some recent developments in interior point methods,
including a theoretical analysis of a primal dual affine scaling algorithm, an implementation
of a large scale infeasible interior point algorithm, and an interior point method for
general convex optimization problems.
Organizer: Masakazu Kojima
Tokyo Institute of Technology, Japan
- A Study of the Homogeneous Algorithm for Convex Optimization Problem
- Erling D. Andersen, Odense University, Denmark; and Yinyu Ye, University of Iowa
- Asymptotic Behavior of Path Following Algorithms
- Clovis Gonzaga, Federal University of Santa Catarina, Brazil
- An Affine Scaling Algorithm with Necessary Centering as a Safeguard
- Gongyun Zhao, Jie Sun, and Jishan Zhu, National University of Singapore, Singapore
- A Matlab-Based Interior-Point Package LIPSOL and Numerical Results
- Yin Zhang, University of Maryland Baltimore County
LMH, 3/15/96