A randomized Mirror-Prox method for solving structured large-scale matrix saddle-point problems

Details A randomized Mirror-Prox method for solving structured large-scale matrix saddle-point problems A randomized Mirror-Prox method for solving structured large-scale matrix saddle-point problems

2011-12-06

arxiv.org/abs/1112.1274v1

Mathematics

Optimization and Control

Scientific paper

In this paper, we derive a randomized version of the Mirror-Prox method for solving some structured matrix saddle-point problems, such as the maximal eigenvalue minimization problem. Deterministic first-order schemes, such as Nesterov's Smoothing Techniques or standard Mirror-Prox methods, require the exact computation of a matrix exponential at every iteration, limiting the size of the problems they can solve. Our method allows us to use stochastic approximations of matrix exponentials. We prove that our randomized scheme decreases significantly the complexity of its deterministic counterpart for large-scale matrix saddle-point problems. Numerical experiments illustrate and confirm our theoretical results.

Affiliated with

Also associated with

No associations

Rating

A randomized Mirror-Prox method for solving structured large-scale matrix saddle-point problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A randomized Mirror-Prox method for solving structured large-scale matrix saddle-point problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A randomized Mirror-Prox method for solving structured large-scale matrix saddle-point problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-381120