75
Voted
SIGSOFT
2011
ACM
14 years 6 months ago
2011
ACM
169
click to vote
SIGSOFT
2011
ACM
14 years 6 months ago
2011
ACM
Developing complex distributed systems is a non-trivial task. It is even more difficult when the systems need to dynamically reconfigure the distributed functionalities or tasks...
SIAMJO
2011
14 years 6 months ago
2011
182
Voted
SIAMJO
2011
14 years 6 months ago
2011
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
115
click to vote
SIAMJO
2011
14 years 6 months ago
2011
This paper is concerned with the study of a class of prox-penalization methods for solving variational inequalities of the form Ax + NC (x) 0 where H is a real Hilbert space, A : H...
107
Voted
SIAMJO
2011
14 years 6 months ago
2011
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...
SIAMJO
2011
14 years 6 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
SIAMJO
2011
14 years 6 months ago
2011
SIAMJO
2011
14 years 6 months ago
2011
SIAMJO
2011
14 years 6 months ago
2011
This is a correction to R. B. Kearfott and S. Hongthong’s article [SIAM J. Optim., 16 (2005), pp. 418–433]. DOI. 10.1137/100816080 There are errors in column 4 (entitled “Und...