## Search

Now showing items 1-5 of 5

#### Privacy-Preserving Linear and Nonlinear Approximation via Linear Programming

(2011)

We propose a novel privacy-preserving random kernel approximation based on a data matrix
A ? Rm�n whose rows are divided into privately owned blocks. Each block of rows belongs to
a different entity that is unwilling to ...

#### Primal-Dual Bilinear Programming Solution of the Absolute Value Equation

(2011)

We propose a finitely terminating primal-dual bilinear programming algorithm for the solution of
the NP-hard absolute value equation (AVE): Ax ? |x| = b, where A is an n � n square matrix. The
algorithm, which makes no ...

#### Privacy-Preserving Horizontally Partitioned Linear Programs

(2010)

We propose a simple privacy-preserving reformulation of a linear program whose equality constraint
matrix is partitioned into groups of rows. Each group of matrix rows and its corresponding right hand side
vector are ...

#### Equivalence of Minimal L0 and Lp Norm Solutions of Linear Equalities, Inequalities and Linear Programs for Sufficiently Small p

(2011)

For a bounded system of linear equalities and inequalities we show that the NP-hard ?0 norm minimization problem min
||x||0 subject to Ax = a, Bx ? b and ||x||? ? 1, is completely equivalent to the concave
minimization ...

#### Absolute Value Equation Solution via Dual Complementarity

(2011)

By utilizing a dual complementarity condition, we propose an iterative method for solving the NPhard
absolute value equation (AVE): Ax?|x| = b, where A is an n�n square matrix. The algorithm
makes no assumptions on the ...