Graph Implementations for Nonsmooth Convex Programs

By Michael Grant, Stephen P. Boyd. 2008

3,055 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Numerical Analysis

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

In Numerical Analysis

Citations in the corpus

Channel estimation for OFDM systems (2017, methodology): “10b illustrates the computation time of the BP algorithm using the CVX software package [19, 20] with the MOSEK solver.”
Eigenstructure assignment in undamped vibrating systems: A convex-constrained modification method based on receptances (2012, neutral): “[15,17]).”
Towards a Mathematical Theory of Super‐resolution (2012, methodology): “(Our simulations use CVX, which in turn calls SDPT3.)”
GEKKO Optimization Suite (2018, methodology): “In addition to those listed above, many other software libraries are available for modeling and optimization, including AIMMS [31], CVX [32], CVXOPT [33], YALMIP [34], PuLP [35], POAMS, OpenOpt, NLPy, and PyIpopt.”
BlackIoT: IoT Botnet of High Wattage Devices Can Disrupt the Power Grid (2018, background): “The security and vulnerability of the IoT against cyber attacks has been widely studied [21,42,45,50,53,57,63].”
CVXPY: A Python-Embedded Modeling Language for Convex Optimization (2016, methodology): “The conversion is done using graph implementations of convex functions (Grant and Boyd, 2008).”
PrivCheck: privacy-preserving check-in data publishing for personalized location based services (2016, methodology): “The prototype of our framework is implemented on a commodity PC (Intel Core i7-4770HQ@2.20GHz, 16GB RAM, OS X), running MATLAB and CVX [14] library to solve the optimization problems in Algorithm 1 and 3.”
Polyhedral approximation in mixed-integer convex optimization (2016, methodology): “Grant and Boyd [21] explain that a tractable representation of the epigraph of an atom is sufficient to incorporate it into a DCP modeling framework.”
A Rewriting System for Convex Optimization Problems (2017, positive): “Our exposition in this section draws from work by Smith (1996), who introduced Smith form, Grant and Boyd (2008), who introduced graph implementations, and Chu, Parikh, Domahidi, and Boyd (2013), who illustrated these three steps with a clear example.”
A Linear-Quadratic Optimal Control Problem for Mean-Field Stochastic Differential Equations in Infinite Horizon (2012, methodology): “Note that the numerical algorithms we have used for checking LMIs or solving SDP are similar to those in [35, 34, 22].”