International Linear Algebra Year
Linear Algebra in Optimization
April 22-25, 1996
 

Organized by CERFACS with the support of INPT-ENSEEIHT-IRIT.

Programme

Monday April 22

• R. Fletcher (University of Dundee, UK),
  An overview of unconstrained optimization, (paper 90K)
• Å. Björck (Linköping University, Sweden),
  Methods for large scale least squares problems
• D.F. Shanno (Rutgers, New Jersey, USA),
  Linear algebra for barrier methods in linear programming

Afternoon session : Tutorial.
Chairman : M. Dayde (ENSEEIHT-IRIT, France)
Invited talks :

• M.J.D. Powell (University of Cambridge, UK),
  Algorithms for linearly constrained optimization calculations
• A.R. Conn (IBM T.J. Watson Research Center, USA),
  A survey of the state-of-the-art of nonlinearly constrained optimization

Tuesday April 23

• R.B. Schnabel (University of Colorado at Boulder, USA),
  Global optimization, parallel optimization
• J. Nocedal (Northwestern University, USA),
  Linear algebra techniques in optimization software
• A. Griewank (speaker) and Jean Utke (TU Dresden, Germany),
  Evaluating Jacobians, Hessians and Newton Steps

Afternoon session : Linear Algebra in Optimization.
Chairman : N. Gould (RAL, UK)
Invited talk :

• W. Murray (speaker), P. Gill, and M. Saunders (Stanford University, USA),
  Numerical aspects of SQP algorithms for large problems

• E. Spedicato (University of Bergamo, Italy),
  ABS Linear Solvers for Optimization
• C. Ashcraft, R. Grimes, and J. Lewis (Boeing Information and Support Services, USA),
  Accurate Symmetric Indefinite Linear Equation Solvers
• A. de Falguerolles (Université Paul Sabatier, France),
  A generalization of singular value decomposition
• N. Alexandrov (NASA Langley Research Center, USA),
  Linear Algebra for Multidisciplinary Optimization
• A. Neumaier (Institut für Mathematik, Universität Wien, Austria) and E. Groeneveld (Institut für Tierzucht und Tierverhalten, Bundesforschungsanstalt für Landwirtschaft, Germany),
  Restricted maximum likelihood estimation of covariances in sparse linear models
• O. Burdakov (CERFACS, France),
  An MST-type algorithm for the optimal basis problem

Wednesday April 24

• R. Chiheb and G. Panassenko (Université Jean Monot, France),
  Optimisation de formes pour la L-convergence: une méthode numérique
• V. Charvillat, Y. Yvinec, B. Rouland, and B. Thiesse (ENSEEIHT-IRIT, France),
  Challenges in Computer Vision Regression
• A. Avello and J.M. Jiménez (CEIT and University of Navarre, Spain),
  Kinematic and Dynamic Optimization of Multibody Systems
• M. Masmoudi, C. Massat-Rauzy, and P. Mader (CERFACS, France),
  A new global optimization method for eigenvalue problems
• D. Noll (Université Paul Sabatier, France),
  Image Restoration : An Approach via Eigenvalue Optimization
• R.B. Sidje and A. Williams (University of Queensland, Australia),
  Fast Generalized Cross Validation

• C. T. Le and J. Noailles (ENSEEIHT-IRIT, France),
  Nonlinear Programming and Trajectory Optimization
• M. D'Apuzzo and G. Toraldo (Research Center on Parallel Computing and Supercomputers, Italy),
  Parallel Computational Issues of Projected Gradient Algorithms for Convex Quadratic Programming with Box Constraints
• W. Gropp, L. Curfman McInnes, and B. Smith (Argonne National Laboratory, USA),
  Bringing Together Linear Algebra and Optimization: A Practical Software Strategy Using PETSc 2.0
• R. Wunderling (Konrad Zuse-Zentrum für Informationstechnik Berlin, Germany),
  Parallelizing the Simplex Algorithm

Thursday April 25

• J.J. Moré (Argonne National Laboratory, USA),
  A preconditioned Newton method for large-scale optimization, (transparencies 83K)
• A.R. Conn (IBM T.J. Watson Research Center, USA), N. Gould (RAL, UK), and Ph.L. Toint (FUNDP, Namur, Belgium) (speaker),
  A new primal-dual method for the solution of nonconvex optimization problems with bounds and linear constraints, (transparencies 39K)
• Yu.G. Evtushenko (speaker) and V.G. Zhadan (Russian Academy of Sciences, Russia),
  Space-transformation technique: the state of the art

• J. Nocedal (Northwestern University, USA), A. Sartenaer (FUNDP, Namur, Belgium) (speaker), and C. Zhu (Northwestern University, USA),
  On the Accuracy of Nonlinear Optimization Algorithms: Preliminary Results for the Steepest-Descent Method

Afternoon session : Algorithms for optimization.
Chairman : M. Benzi (CERFACS, France and University of Bologna, Italy)
Invited talk :

• C. Lemaréchal (speaker) and C. Sagastizábal (INRIA, France),
  The U-derivatives of a convex function

• A. Dax (Hydrological Service, Israel),
  A proximal point algorithm for minimax problems

Local organizing committee

Location

For more information, please contact:

   ILAY Secretariat
   CERFACS                               Fax : (+33) 5-61-19-30-00 
   Parallel Algorithms Project
   42 Avenue G. Coriolis                 Email : wlay@cerfacs.fr
   31057 Toulouse CEDEX
   France