A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Matrix-Free Convex Optimization Modeling
[chapter]
2016
Optimization and Its Applications in Control and Data Sciences
We introduce a convex optimization modeling framework that transforms a convex optimization problem expressed in a form natural and convenient for the user into an equivalent cone program in a way that preserves fast linear transforms in the original problem. By representing linear functions in the transformation process not as matrices, but as graphs that encode composition of linear operators, we arrive at a matrix-free cone program, i.e., one whose data matrix is represented by a linear
doi:10.1007/978-3-319-42056-1_7
fatcat:esxdma3ymncjrf3uc7wkqpoygy