SIAMJO
2010
13 years 7 months ago
2010
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
SAGT
2010
Springer
13 years 11 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
SAGT
2010
Springer
13 years 11 months ago
2010
Springer
Recent results showing PPAD-completeness of the problem of computing an equilibrium for Fisher’s market model under additively separable, piecewise-linear, concave utilities (pl...
CORR
2010
Springer
14 years 18 days ago
2010
Springer
Abstract--We consider the problem of recovering a lowrank matrix when some of its entries, whose locations are not known a priori, are corrupted by errors of arbitrarily large magn...
NIPS
2007
14 years 1 months ago
2007
Stability is a desirable characteristic for linear dynamical systems, but it is often ignored by algorithms that learn these systems from data. We propose a novel method for learn...