SIAMJO
2011
13 years 1 months ago
2011
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
SIAMJO
2011
13 years 5 months ago
2011
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
SIAMJO
2011
13 years 5 months ago
2011
We present a class of inexact adaptive multilevel trust-region SQP-methods for the efficient solution of optimization problems governed by nonlinear partial differential equations...
SIAMJO
2011
13 years 5 months ago
2011
SIAMJO
2011
13 years 5 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...
SIAMJO
2011
13 years 5 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...
SIAMJO
2011
13 years 5 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
13 years 5 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
13 years 5 months ago
2011
SIAMJO
2011
13 years 5 months ago
2011