A Dynamical Approach to Two-Block Separable Convex Optimization Problems with Linear Constraints
DOI10.1080/01630563.2020.1845730zbMath1470.90073arXiv2005.09953OpenAlexW3120242744MaRDI QIDQ4985172
Ernö Robert Csetnek, Sandy Bitterlich, Gert Wanka
Publication date: 22 April 2021
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.09953
convex optimizationdualitydynamical systemsubdifferentialLagrangiansaddle pointsLyapunov analysisprimal dual algorithmstructured convex minimizationproximal AMA
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Continuous gradient projection method in Hilbert spaces
- Continuous dynamics related to monotone inclusions and non-smooth optimization problems
- Conjugate duality in convex optimization
- Asymptotic convergence of nonlinear contraction semigroups in Hilbert space
- Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators
- A primal-dual dynamical approach to structured convex minimization problems
- Newton-like dynamics and forward-backward methods for structured monotone inclusions in Hilbert spaces
- The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints
- Convergence of a relaxed inertial forward-backward algorithm for structured monotone inclusions
- Shadow Douglas-Rachford splitting for monotone inclusions
- Semi-groups of nonlinear contractions and dissipative sets
- Propriétés régularisantes de certains semi-groupes non linéaires
- Second Order Forward-Backward Dynamical Systems For Monotone Inclusion Problems
- A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
- A Continuous Dynamical Newton-Like Approach to Solving Monotone Inclusions
- Evolution equations for maximal monotone operators: asymptotic analysis in continuous and discrete time
- Dynamical systems and forward–backward algorithms associated with the sum of a convex subdifferential and a monotone cocoercive operator
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- A forward-backward-forward differential equation and its asymptotic properties
- Fast Alternating Direction Optimization Methods
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: A Dynamical Approach to Two-Block Separable Convex Optimization Problems with Linear Constraints