This conference concerns research on the use, design, and analysis of efficient optimization algorithms. Both theoretical and computational studies are welcome. Typical, but not exclusive, topics of interest include: interior point methods for linear and nonlinear optimization; semidefinite optimization; engineering applications; sensitivity analysis; quadratic optimization; linear complementarity problems; nonlinear optimization; integer and combinatorial optimization; approximation algorithms; graph and network algorithms; network flows; scheduling theory and algorithms.
Contributions are solicited for presentation at the conference. Each accepted paper will be allotted a 25 minute talk. A volume with the abstracts of the invited and contributed talks will be distributed to all conference attendants. Authors wishing to speak should submit an abstract by June 30, 2005 using the On-Line Abstract Submission Form below.