On the Differentiability of the Solution to Convex Optimization Problems
arXiv:1804.05098
Abstract
In this paper, we provide conditions under which one can take derivatives of the solution to convex optimization problems with respect to problem data. These conditions are (roughly) that Slater's condition holds, the functions involved are twice differentiable, and that a certain Jacobian matrix is non-singular. The derivation involves applying the implicit function theorem to the necessary and sufficient KKT system for optimality.
Cited by in corpus (8)
- DeepEMD: Differentiable Earth Mover's Distance for Few-Shot Learning
- Learnable Graph Matching: Incorporating Graph Partitioning with Deep Feature Learning for Multiple Object Tracking
- Learnable Graph Matching: A Practical Paradigm for Data Association
- Learning Convex Optimization Control Policies
- A Stackelberg Game Approach to Control the Overall Load Consumption of a Residential Neighborhood
- Reliability of Single-Level Equality-Constrained Inverse Optimal Control
- Optimizing for Generalization in Machine Learning with Cross-Validation Gradients
- End-to-End Demand Response Model Identification and Baseline Estimation with Deep Learning