University of Birmingham, UK
The success of modern codes for large-scale optimisation is heavily dependent on the use of effective tools of numerical linear algebra. On the other hand, many problems in numerical linear algebra lead to linear, nonlinear or semidefinite optimisation problems. The purpose of the conference is to bring together researchers from both communities and to find and communicate points and topics of common interest.
Conference topics include any subject that could be of interest to both communities, such as:
• Direct and iterative methods for large sparse linear systems.
• Eigenvalue computation and optimisation.
• Large-scale nonlinear and semidefinite programming.
• Effect of round-off errors, stopping criteria, embedded iterative procedures.
• Optimisation issues for matrix polynomials.
• Fast matrix computations.
• Compressed/sparse sensing.
• PDE-constrained optimisation.
• Applications and real time optimisation.
Roland Freund (University of California, Davis)
Philip Gill (University of California, San Diego)
Serge Gratton (CERFACS, Toulouse)
Anne Greenbaum (University of Washington, Seattle)
Michael Hintermueller (Humboldt University, Berlin)
Sabine van Huffel (K.U. Leuven)
Mike Powell (University of Cambridge)
Andrea Walther (University of Paderborn)
Instructions for Contributors
Mini-symposium proposals and contributed talks are invited on all aspects of numerical linear algebra and optimisation. Mini-symposium proposals in plain text/LaTeX should be submitted to email@example.com by 30 March 2012. Organisers will be advised of acceptance by 10 April 2012. Contributed talks and mini-symposia talks will be accepted on the basis of a half-page extended abstract in plain text/LaTeX which should be submitted by 30 April 2012 online at http://online.ima.org.uk/ or by e-mail to firstname.lastname@example.org. Authors will be advised of acceptance by 30 May 2012. A book of abstracts will be made available to delegates at the conference.