2018
DOI: 10.1080/23307706.2017.1397554
|View full text |Cite
|
Sign up to set email alerts
|

A rewriting system for convex optimization problems

Abstract: We describe a modular rewriting system for translating optimization problems written in a domain-specific language to forms compatible with low-level solver interfaces. Translation is facilitated by reductions, which accept a category of problems and transform instances of that category to equivalent instances of another category. Our system proceeds in two key phases: analysis, in which we attempt to find a suitable solver for a supplied problem, and canonicalization, in which we rewrite the problem in the se… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
357
0
2

Year Published

2019
2019
2022
2022

Publication Types

Select...
6
3
1

Relationship

1
9

Authors

Journals

citations
Cited by 539 publications
(359 citation statements)
references
References 52 publications
0
357
0
2
Order By: Relevance
“…All simulations are done with the CVXPY package [30] in PYTHON 3. All codes are available on GitHub at https://github.com/Emergent-Behaviors-in-Biology/species-packing-bound.…”
Section: Simulation Detailsmentioning
confidence: 99%
“…All simulations are done with the CVXPY package [30] in PYTHON 3. All codes are available on GitHub at https://github.com/Emergent-Behaviors-in-Biology/species-packing-bound.…”
Section: Simulation Detailsmentioning
confidence: 99%
“…Moreover, analytical inversion is limited to the oversampled regime, and its breakdown is observed at the Shannon-Nyquist sampling limit [22]. Compressive sensing (CS) extends reconstruction into the undersampling regime under conditions of sparsity, in our work CS was implemented for comparison to DL using the python package "cvxpy" [45]. Spectral reconstruction via DL was implemented using a convolutional neural network (CNN), composed of a series of convolutional layers followed by two fully connected layers of 512 and 256 nodes with dropout regularization using 70% keep probability.…”
Section: Methodsmentioning
confidence: 99%
“…Since the problem becomes a Quadratically Constrained Quadratic Program (QCQP), we leave the rest to the CVXPY python package [27,28]. The details of the derivation related to update X can be found in the Supplementary Material C.3.…”
Section: The Netrex-cf Algorithmmentioning
confidence: 99%