ECOSolveR Examples

L1 minimization (Linear Programming)

We solve the following problem that arises for example in sparse signal reconstruction problems such as compressed sensing: \begin{array}{ll} \text{minimize} & \|x\|_1 \\ \text{subject to} & Ax = b \end{array} \qquad (L_1)

with x\in R^n, A \in R^{m \times n} and m\leq n. Reformulate the problem expressing the L_1 norm of x as follows \begin{aligned} x &\leq u \\ -x &\leq u \end{aligned}

where u\in R^n and we minimize the sum of u. The reformulated problem using the stacked variables

z = \begin{pmatrix}x\\u\end{pmatrix}

is now \begin{array}{ll} \text{minimize} & c^{\top}z \\ \text{subject to} & \tilde{A}z = b \\ & Gz \leq h \end{array} \qquad \text{(LP)} where the inequality is with respective to the positive orthant.

Here is the R code that generates a random instance of this problem and solves it.

library(ECOSolveR)
library(Matrix)
set.seed(182391)
n <- 1000L
m <- 10L
density <- 0.01
c <- c(rep(0.0, n), rep(1.0, n))

First, a function to generate random sparse matrices with normal entries.

sprandn <- function(nrow, ncol, density) {
    items <- ceiling(nrow * ncol * density)
    matrix(c(rnorm(items),
             rep(0, nrow * ncol - items)),
           nrow = nrow)
}

A <- sprandn(m, n, density)
Atilde <- Matrix(cbind(A, matrix(rep(0.0, m * n), nrow = m)), sparse = TRUE)
b <- rnorm(m)
I <- diag(n)
G <- rbind(cbind(I, -I),
           cbind(-I, -I))
G <- as(G, "dgCMatrix")
h <- rep(0.0, 2L * n)
dims <- list(l = 2L * n, q = NULL, e = 0L)

Note how ECOS expects sparse matrices, not ordinary matrices.

## Solve the problem
z <- ECOS_csolve(c = c, G = G, h = h, dims = dims, A = Atilde, b = b)

We check that the solution was found.

names(z)

## [1] "x"          "y"          "s"          "z"          "infostring"
## [6] "retcodes"   "summary"    "timing"

z$infostring

## [1] "Optimal solution found"

Extract the solution.

x <- z$x[1:n]
u <- z$x[(n+1):(2*n)]
nnzx = sum(abs(x) > 1e-8)
sprintf("x reconstructed with %d non-zero entries", nnzx / length(x) * 100)

## [1] "x reconstructed with 1 non-zero entries"

Parametric Optimization with the Update-Solve Loop

When solving a sequence of related problems that share the same sparsity structure but differ in numerical data, the multi-step lifecycle API avoids repeating the expensive symbolic analysis and KKT ordering phase. The pattern is:

ECOS_setup() — one-time setup (symbolic analysis)
Loop: ECOS_update() + ECOS_solve() — cheap re-solves
ECOS_cleanup() — free workspace

Here we vary the right-hand side h of the LP from the previous example, tracing how the optimal value changes as we scale h.

## Set up workspace once
ws <- ECOS_setup(c = c, G = G, h = h, dims = dims, A = Atilde, b = b)

## Sweep a parameter: scale h from 0 to 1
alphas <- seq(0, 1, length.out = 11)
pcosts <- numeric(length(alphas))

for (i in seq_along(alphas)) {
    ECOS_update(ws, h = h + alphas[i])
    res <- ECOS_solve(ws)
    pcosts[i] <- res$summary[["pcost"]]
}

ECOS_cleanup(ws)

## Show results
data.frame(alpha = alphas, pcost = round(pcosts, 4))

##    alpha     pcost
## 1    0.0   12.8872
## 2    0.1  -87.1128
## 3    0.2 -187.1128
## 4    0.3 -287.1128
## 5    0.4 -387.1128
## 6    0.5 -487.1128
## 7    0.6 -587.1128
## 8    0.7 -687.1128
## 9    0.8 -787.1128
## 10   0.9 -887.1128
## 11   1.0 -987.1128

For comparison, the same sweep using ECOS_csolve() in a loop would call ECOS_setup and ECOS_cleanup at every iteration. The lifecycle API is particularly beneficial when the problem dimensions are large and setup dominates solve time.

2026-10-16

L1 minimization (Linear Programming)

Parametric Optimization with the Update-Solve Loop