A primal-dual flow for affine constrained convex optimization
From MaRDI portal
Publication:5864593
DOI10.1051/cocv/2022032zbMath1500.90048arXiv2103.06636OpenAlexW3133999683WikidataQ114011459 ScholiaQ114011459MaRDI QIDQ5864593
Publication date: 8 June 2022
Published in: ESAIM: Control, Optimisation and Calculus of Variations (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.06636
discretizationconvex optimizationLyapunov functiondynamical systemexponential decayprimal-dual algorithmsemi-smooth Newton methodlinear constraint\(l_1-l_2\) minimizationnonergodic linear ratetotal-variation model
Related Items
A fast solver for generalized optimal transport problems based on dynamical system and algebraic multigrid ⋮ Inertial primal-dual dynamics with damping and scaling for linearly constrained convex optimization problems ⋮ Transformed primal-dual methods for nonlinear saddle point systems ⋮ Second-order flows for computing the ground states of rotating Bose-Einstein condensates ⋮ A second order primal-dual dynamical system for a convex-concave bilinear saddle point problem ⋮ Fast primal-dual algorithm via dynamical system for a linearly constrained convex optimization problem
Uses Software
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Nonlinear total variation based noise removal algorithms
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Fast convex optimization via inertial dynamics with Hessian driven damping
- Gradient methods for minimizing composite functions
- Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
- Stability of primal-dual gradient dynamics and applications to network optimization
- Inexact accelerated augmented Lagrangian methods
- Asymptotic convergence of constrained primal-dual dynamics
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Newton and quasi-Newton methods for normal maps with polyhedral sets
- An algorithm for total variation minimization and applications
- An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
- A first-order primal-dual algorithm for convex problems with applications to imaging
- On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration
- Accelerated linearized Bregman method
- Iteration-complexity of first-order penalty methods for convex programming
- From differential equation solvers to accelerated first-order methods for convex optimization
- A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm
- On the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splitting
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- A nonsmooth version of Newton's method
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
- Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems
- A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- Saddle-Point Dynamics: Conditions for Asymptotic Stability of Saddle Points
- Accelerated Uzawa methods for convex optimization
- Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
- Analysis and Generalizations of the Linearized Bregman Method
- Linearized Bregman iterations for compressed sensing
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Nonlinear Evolution and Difference Equations of Monotone Type in Hilbert Spaces
- Partial Error Bound Conditions and the Linear Convergence Rate of the Alternating Direction Method of Multipliers
- Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Convergence Rates of Inertial Primal-Dual Dynamical Methods for Separable Convex Optimization Problems
- Atomic Decomposition by Basis Pursuit
- THE HEAVY BALL WITH FRICTION METHOD, I. THE CONTINUOUS DYNAMICAL SYSTEM: GLOBAL EXPLORATION OF THE LOCAL MINIMA OF A REAL-VALUED FUNCTION BY ASYMPTOTIC ANALYSIS OF A DISSIPATIVE DYNAMICAL SYSTEM
- Algebraic multigrid methods
- First-Order Methods in Optimization
- A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization
- A variational perspective on accelerated methods in optimization
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates
- Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming
- Faster Lagrangian-Based Methods in Convex Optimization
- Inertial, Corrected, Primal-Dual Proximal Splitting
- An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
- On the Convergence of Primal-Dual Hybrid Gradient Algorithm
- Primal-Dual Extragradient Methods for Nonlinear Nonsmooth PDE-Constrained Optimization
- Self Equivalence of the Alternating Direction Method of Multipliers
- Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions
- ROBUST SUBSPACE CORRECTION METHODS FOR NEARLY SINGULAR SYSTEMS
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- An introduction to continuous optimization for imaging
- Approximate first-order primal-dual algorithms for saddle point problems
- Accelerated differential inclusion for convex optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A primal-dual flow for affine constrained convex optimization
