1.2k citations · 3.4k across the 72 of their papers we have counts for
9 papers · 2 filters
Linear Programming Heuristics for the Graph Isomorphism Problem
Reza Takapoui, Stephen Boyd
An isomorphism between two graphs is a bijection between their vertices that preserves the edges. We consider the problem of determining whether two finite undirected weighted grap…
A New Architecture for Optimization Modeling Frameworks
Matt Wytock, Steven Diamond, Felix Heide +1
We propose a new architecture for optimization modeling frameworks in which solvers are expressed as computation graphs in a framework like TensorFlow rather than as standalone pro…
Disciplined Multi-Convex Programming
Xinyue Shen, Steven Diamond, Madeleine Udell +2
A multi-convex optimization problem is one in which the variables can be partitioned into sets over which the problem is convex when the other variables are fixed. Multi-convex pro…
Greedy Gaussian Segmentation of Multivariate Time Series
David Hallac, Peter Nystrup, Stephen Boyd
We consider the problem of breaking a multivariate (vector) time series into segments over which the data is well explained as independent samples from a Gaussian distribution. We…
Disciplined Convex-Concave Programming
Xinyue Shen, Steven Diamond, Yuantao Gu +1
In this paper we introduce disciplined convex-concave programming (DCCP), which combines the ideas of disciplined convex programming (DCP) with convex-concave programming (CCP). Co…
Line Search for Averaged Operator Iteration
Pontus Giselsson, Mattias Fält, Stephen Boyd
Many popular first order algorithms for convex optimization, such as forward-backward splitting, Douglas-Rachford splitting, and the alternating direction method of multipliers (AD…