Fetching the paper…
Reading the bibliography…
We consider the problem of efficiently computing the derivative of the solution map of a convex cone program, when it exists.
Lezioni di Analisi Infinitesimale
U. Dini · 1907
Earlier work this paper cites.
Calculus tangentium differentialis
G.W. Leibniz · 1920
Earlier work this paper cites.
Portfolio selection
H. Markowitz · 1952
Earlier work this paper cites.
Programs for automatic differentiation for the machine BESM
L. M. Beda, L. N. Korolev, N. V. Sukkikh, and T. S. Frolova · 1959
Earlier work this paper cites.
A simple automatic derivative evaluation program
R. Wengert · 1964
Earlier work this paper cites.
Nonlinear Programming: Sequential Unconstrained Minimization Techniques
A. Fiacco and G. McCormick · 1968
Earlier work this paper cites.
Strongly regular generalized equations
S. Robinson · 1980
Earlier work this paper cites.
Compiling fast partial derivatives of functions given by algorithms
B. Speelpenning · 1980
Earlier work this paper cites.
LSQR: An algorithm for sparse linear equations and sparse least squares
C. Paige and M. Saunders · 1982
Earlier work this paper cites.
Learning representations by back-propagating errors
D. Rumelhart, G. Hinton, and R. Williams · 1988
Earlier work this paper cites.
On automatic differentiation
A. Griewank · 1989
Earlier work this paper cites.
Linear Matrix Inequalities in System and Control Theory
S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan · 1994
Earlier work this paper cites.
Interior-point Polynomial Algorithms in Convex Programming
Y. Nesterov and A. Nemirovskii · 1994
Earlier work this paper cites.
An O ( n L ) {O}(\sqrt{n}{L}) -iteration homogeneous and self-dual linear programming algorithm
Y. Ye, M. Todd, and S. Mizuno · 1994
Earlier work this paper cites.
Perturbation Analysis of Optimization Problems
J. Bonnans and A. Shapiro · 2000
Earlier work this paper cites.
Lectures on Modern Convex Optimization
A. Ben-Tal and A. Nemirovski · 2001
Earlier work this paper cites.
SciPy: Open source scientific tools for Python, 2001
E. Jones, T. Oliphant, P. Peterson, et al · 2001
Earlier work this paper cites.
A robust optimization approach to supply chain management
D. Bertsimas and A. Thiele · 2004
Cited alongside, same era.
Convex Optimization
S. Boyd and L. Vandenberghe · 2004
Cited alongside, same era.
YALMIP: A toolbox for modeling and optimization in MATLAB
J. Löfberg · 2004
Cited alongside, same era.
Retailer-supplier flexible commitments contracts: A robust optimization approach
A. Ben-Tal, B. Golany, A. Nemirovski, and J.-P. Vial · 2005
Cited alongside, same era.
Advances in convex optimization: Conic programming
A. Nemirovski · 2007
Cited alongside, same era.
Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation
A. Griewank and A. Walther · 2008
Cited alongside, same era.
Conic optimization via operator splitting and homogeneous self-dual embedding
B. O’Donoghue, E. Chu, N. Parikh, and S. Boyd · 2016
Later among the works it cites.
OptNet: Differentiable optimization as a layer in neural networks
B. Amos and Z. Kolter · 2017
Later among the works it cites.
A semismooth Newton method for fast, generic convex programming
A. Ali, E. Wong, and Z. Kolter · 2017
Later among the works it cites.
Multi-period trading via convex optimization
S. Boyd, E. Busseti, S. Diamond, R. Kahn, K. Koh, P. Nystrup, and J. Speth · 2017
Later among the works it cites.
Task-based end-to-end model learning in stochastic optimization
P. Donti, B. Amos, and Z. Kolter · 2017
Later among the works it cites.
Automatic differentiation in PyTorch
A. Paszke, S. Gross, S. Chintala, G. Chanan, E. Yang, Z. DeVito, Z. Lin, A. Desmaison, L. Antiga, and A. Lerer · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Implicit Functions and Solution Mappings
A. Dontchev and R. Rockafellar · 2009
Cited alongside, same era.
The Elements of Statistical Learning: Data Mining, Inference, and Prediction
T. Hastie, R. Tibshirani, and J. Friedman · 2009
Cited alongside, same era.
A semiotic reflection on the didactics of the chain rule
O. Rodríguez and J. Fernandez · 2010
Cited alongside, same era.
Distributed optimization and statistical learning via the alternating direction method of multipliers
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein · 2011
Cited alongside, same era.
The NumPy array: A structure for efficient numerical computation
S. Van Der Walt, C. Colbert, and G. Varoquaux · 2011
Cited alongside, same era.
CVX: Matlab software for disciplined convex programming, version 2.1
M. Grant and S. Boyd · 2014
Cited alongside, same era.
Later among the works it cites.
Differentiable MPC for end-to-end planning and control
B. Amos, I. Jimenez, J. Sacks, B. Boots, and Z. Kolter · 2018
Later among the works it cites.
A rewriting system for convex optimization problems
A. Agrawal, R. Verschueren, S. Diamond, and S. Boyd · 2018
Later among the works it cites.
Solution refinement at regular points of conic problems
E. Busseti, W. Moursi, and S. Boyd · 2018
Later among the works it cites.
End-to-end differentiable physics for learning and control
F. de Avila Belbute-Peres, K. Smith, K. Allen, J. Tenenbaum, and Z. Kolter · 2018
Later among the works it cites.
Compiling machine learning programs via high-level tracing
R. Frostig, M. Johnson, and C. Leary · 2018
Later among the works it cites.
What game are we playing? End-to-end learning in normal and extensive form games
C. Ling, F. Fang, and Z. Kolter · 2018
Later among the works it cites.
TensorFlow Eager: A multi-stage, Python-embedded DSL for machine learning
A. Agrawal, A. Modi, A. Passos, A. Lavoie, Ashish Agarwal, A. Shankar, I. Ganichev, J. Levenberg, M. Hong, R. Monga, and S. Cai · 2019
Closest in time.
CVXR: An R package for disciplined convex optimization
A. Fu, B. Narasimhan, and S. Boyd · 2019
Closest in time.
Don’t unroll adjoint: Differentiating SSA-form programs
M. Innes · 2019
Closest in time.
N. Moehle, E. Busseti, S. Boyd, and M. Wytock · 2019
Closest in time.