University of Cambridge > Talks.cam > Numerical Analysis > On condition numbers, metric regularity and a condition measure for a matrix game problem

On condition numbers, metric regularity and a condition measure for a matrix game problem

Add to your list(s) Download to your calendar using vCal

  • UserVera Roshchina (University of Evora, Portugal)
  • ClockThursday 19 May 2011, 15:00-16:00
  • HouseCMS, MR14.

If you have a question about this talk, please contact Dr Shadrin.

There are beautiful relations between distance to ill-posedness, condition numbers, metric regularity and complexity of numerical algorithms that appear here and there in Complexity theory and Optimization (important examples include numerical linear algebra, conic feasibility problems and homotopy algorithms for solving polynomial systems). A condition measure for zero-sum matrix games (introduced by Javier Peña et al) nicely fits into this framework. Using techniques of variational analysis, we have obtained a precise characterization of this condition measure via metric regularity modulus of a related mapping, and gave an exact expression for its evaluation via the problem’s matrix.

This talk is part of the Numerical Analysis series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity