Convergence Rates of Inertial Primal-Dual Dynamical Methods for Separable Convex Optimization Problems
نویسندگان
چکیده
In this paper, we propose a second-order continuous primal-dual dynamical system with time-dependent positive damping terms for separable convex optimization problem linear equality constrai...
منابع مشابه
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...
متن کاملInertial Primal-dual Algorithms for Structured Convex Optimization
The primal-dual algorithm recently proposed by Chambolle & Pock (abbreviated as CPA) for structured convex optimization is very efficient and popular. It was shown by Chambolle & Pock in [16] and also by Shefi & Teboulle in [49] that CPA and variants are closely related to preconditioned versions of the popular alternating direction method of multipliers (abbreviated as ADM). In this paper, we ...
متن کاملWell-Posedness and Primal-Dual Analysis of Some Convex Separable Optimization Problems
We focus on some convex separable optimization problems, considered by the author in previous papers, for which problems, necessary and sufficient conditions or sufficient conditions have been proved, and convergent algorithms of polynomial computational complexity have been proposed for solving these problems.The concepts ofwell-posedness of optimization problems in the sense of Tychonov, Hada...
متن کاملPrimal and dual approximation algorithms for convex vector optimization problems
Two approximation algorithms for solving convex vector optimization problems (CVOPs) are provided. Both algorithms solve the CVOP and its geometric dual problem simultaneously. The first algorithm is an extension of Benson’s outer approximation algorithm, and the second one is a dual variant of it. Both algorithms provide an inner as well as an outer approximation of the (upper and lower) image...
متن کاملCoupled-decompositions: exploiting primal-dual interactions in convex optimization problems
Decomposition techniques implement the so-called “divide and conquer” in convex optimization problems, being primal and dual decompositions the two classical approaches. Although both solutions achieve the goal of splitting the original program into several smaller problems (called the subproblems), these techniques exhibit in general slow speed of convergence. This is a limiting factor in prac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Siam Journal on Control and Optimization
سال: 2021
ISSN: ['0363-0129', '1095-7138']
DOI: https://doi.org/10.1137/20m1355379