Online Primal-Dual Methods With Measurement Feedback for Time-Varying Convex Optimization
نویسندگان
چکیده
منابع مشابه
Primal-dual subgradient methods for convex problems
In this paper we present a new approach for constructing subgradient schemes for different types of nonsmooth problems with convex structure. Our methods are primaldual since they are always able to generate a feasible approximation to the optimum of an appropriately formulated dual problem. Besides other advantages, this useful feature provides the methods with a reliable stopping criterion. T...
متن کاملA Universal Primal-Dual Convex Optimization Framework
In recent years, longitudinal data have become increasingly relevant in many applications, heightening interest in selecting the best longitudinal model to analyze them. Too often traditional practices rather than substantive theory guide the specific longitudinal model selected for the analysis. This opens the possibility that alternative models might better correspond to the data. In this reg...
متن کاملPrimal-dual Solution Perturbations in Convex Optimization
Solutions to optimization problems of convex type are typically characterized by saddle point conditions in which the primal vector is paired with a dual ‘multiplier’ vector. This paper investigates the behavior of such a primal-dual pair with respect to perturbations in parameters on which the problem depends. A necessary and sufficient condition in terms of certain matrices is developed for t...
متن کاملA Universal Primal-Dual Convex Optimization Framework
A Universal Primal-Dual Convex Optimization Framework In this supplementary document, we provide the technical proofs and additional implementation details, and it is organized as follows: Section A defines the key estimates, that forms the basis of the universal gradient algorithms. Sections B and C present the proofs of Theorems 4.1 and 4.2 respectively. Finally, Section D provides the implem...
متن کاملProximal Primal-Dual Optimization Methods
In the field of inverse problems, one of the main benefits which can be drawn from primal-dual optimization approaches is that they do not require any linear operator inversion. In addition, they allow to split a convex objective function in a sum of simpler terms which can be dealt with individually either through their proximity operator or through their gradient if they correspond to smooth ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2019
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2019.2896112