On the Differentiability of the Solution to Convex Optimization Problems
Optimization and Control
2019-11-13 v3
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.
Cite
@article{arxiv.1804.05098,
title = {On the Differentiability of the Solution to Convex Optimization Problems},
author = {Shane Barratt},
journal= {arXiv preprint arXiv:1804.05098},
year = {2019}
}