A dynamical approach to two-block separable convex optimization problems with linear constraints
From MaRDI portal
Abstract: The aim of this manuscript is to approach by means of first order differential equations/inclusions convex programming problems with two-block separable linear constraints and objectives, whereby (at least) one of the components of the latter is assumed to be strongly convex. Each block of the objective contains a further smooth convex function. We investigate the dynamical system proposed and prove that its trajectories asymptotically converge to a saddle point of the Lagrangian of the convex optimization problem. Time discretization of the dynamical system leads to the alternating minimization algorithm AMA and also to its proximal variant recently introduced in the literature.
Recommendations
- Convergence rates of inertial primal-dual dynamical methods for separable convex optimization problems
- A primal-dual dynamical approach to structured convex minimization problems
- Alternating proximal algorithms for weakly coupled convex minimization problems. Applications to dynamical games and PDE's
- Fast primal-dual algorithm via dynamical system for a linearly constrained convex optimization problem
- Fast convergence of dynamical ADMM via time scaling of damped inertial dynamics
Cites work
- A continuous dynamical Newton-like approach to solving monotone inclusions
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- A forward-backward-forward differential equation and its asymptotic properties
- A primal-dual dynamical approach to structured convex minimization problems
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Asymptotic convergence of nonlinear contraction semigroups in Hilbert space
- Conjugate duality in convex optimization
- Continuous dynamics related to monotone inclusions and non-smooth optimization problems
- Continuous gradient projection method in Hilbert spaces
- Convergence of a relaxed inertial forward-backward algorithm for structured monotone inclusions
- Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators
- Convex analysis and monotone operator theory in Hilbert spaces
- Dynamical systems and forward-backward algorithms associated with the sum of a convex subdifferential and a monotone cocoercive operator
- Evolution equations for maximal monotone operators: asymptotic analysis in continuous and discrete time
- Fast alternating direction optimization methods
- scientific article; zbMATH DE number 48893 (Why is no real title available?)
- scientific article; zbMATH DE number 3498726 (Why is no real title available?)
- scientific article; zbMATH DE number 917233 (Why is no real title available?)
- scientific article; zbMATH DE number 3398324 (Why is no real title available?)
- Newton-like dynamics and forward-backward methods for structured monotone inclusions in Hilbert spaces
- Propriétés régularisantes de certains semi-groupes non linéaires
- Second order forward-backward dynamical systems for monotone inclusion problems
- Semi-groups of nonlinear contractions and dissipative sets
- Shadow Douglas-Rachford splitting for monotone inclusions
- The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints
Cited in
(4)- A primal-dual dynamical approach to structured convex minimization problems
- On the Arrow–Hurwicz differential system for linearly constrained convex minimization
- A unified differential equation solver approach for separable convex optimization: splitting, acceleration and nonergodic rate
- Convergence rates of mixed primal-dual dynamical systems with Hessian driven damping
This page was built for publication: A dynamical approach to two-block separable convex optimization problems with linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4985172)
