A unified primal-dual algorithm framework for inequality constrained problems
From MaRDI portal
Publication:6057147
Abstract: In this paper, we propose a unified primal-dual algorithm framework based on the augmented Lagrangian function for composite convex problems with conic inequality constraints. The new framework is highly versatile. First, it not only covers many existing algorithms such as PDHG, Chambolle-Pock (CP), GDA, OGDA and linearized ALM, but also guides us to design a new efficient algorithm called Simi-OGDA (SOGDA). Second, it enables us to study the role of the augmented penalty term in the convergence analysis. Interestingly, a properly selected penalty not only improves the numerical performance of the above methods, but also theoretically enables the convergence of algorithms like PDHG and SOGDA. Under properly designed step sizes and penalty term, our unified framework preserves the ergodic convergence while not requiring any prior knowledge about the magnitude of the optimal Lagrangian multiplier. Linear convergence rate for affine equality constrained problem is also obtained given appropriate conditions. Finally, numerical experiments on linear programming, minimization problem, and multi-block basis pursuit problem demonstrate the efficiency of our methods.
Recommendations
- A primal-dual algorithm framework for convex saddle-point optimization
- Primal-dual proximal algorithms for structured convex optimization: a unifying framework
- Unified linear convergence of first-order primal-dual algorithms for saddle point problems
- A unified primal-dual algorithm framework based on Bregman iteration
- Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems
Cites work
- A convergent 3-block semi-proximal ADMM for convex minimization problems with one strongly convex block
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A forward-backward splitting method for monotone inclusions without cocoercivity
- A primal-dual algorithm with line search for general convex-concave saddle point problems
- A semismooth Newton method with multidimensional filter globalization for l₁-optimization
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Constrained composite optimization and augmented Lagrangian methods
- Convergence rate of \(\mathcal{O}(1/k)\) for optimistic gradient and extragradient methods in smooth convex-concave saddle point problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex optimization algorithms
- Discerning the linear convergence of ADMM for structured convex optimization through the lens of variational analysis
- scientific article; zbMATH DE number 3177945 (Why is no real title available?)
- Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- On the convergence analysis of the alternating direction method of multipliers with three blocks
- On the convergence of primal-dual hybrid gradient algorithm
- On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the ergodic convergence rates of a first-order primal-dual algorithm
- On the Global Linear Convergence of the ADMM with MultiBlock Variables
- On the sublinear convergence rate of multi-block ADMM
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Primal-Dual First-Order Methods for Affinely Constrained Multi-block Saddle Point Problems
- Randomized primal-dual proximal block coordinate updates
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- Variational Analysis
Cited in
(7)- A primal-dual algorithm framework for convex saddle-point optimization
- scientific article; zbMATH DE number 4100438 (Why is no real title available?)
- A unified differential equation solver approach for separable convex optimization: splitting, acceleration and nonergodic rate
- FIRM: federated image reconstruction using multimodal tomographic data
- The augmented Lagrangian methods: overview and recent advances
- A new insight on the prediction-correction framework with applications to several first-order methods
- The primal-dual algorithm as a constraint-set-manipulation device
This page was built for publication: A unified primal-dual algorithm framework for inequality constrained problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057147)
