An alternate minimization method beyond positive definite proximal regularization: convergence and complexity
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1042861
- A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints
- Alternating proximal gradient method for convex minimization
- A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization
- An extragradient-based alternating direction method for convex minimization
- The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization
- scientific article; zbMATH DE number 6453672
- A proximal point algorithm revisit on the alternating direction method of multipliers
- A regularized alternating direction method of multipliers for a class of nonconvex problems
- The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
Cites work
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- A decomposition property for a class of square matrices
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A new inexact alternating directions method for monotone variational inequalities
- A note on the alternating direction method of multipliers
- A strictly contractive Peaceman-Rachford splitting method for convex programming
- A unified primal-dual algorithm framework based on Bregman iteration
- Alternating direction method for image inpainting in wavelet domains
- An ADM-based splitting method for separable convex programming
- Asynchronous Distributed ADMM for Large-Scale Optimization—Part II: Linear Convergence Analysis and Numerical Performance
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Auxiliary principle and algorithm for mixed equilibrium problems and bilevel mixed equilibrium problems in Banach spaces
- Co-Coercivity and Its Role in the Convergence of Iterative Schemes for Solving Variational Inequalities
- Convergence study on the symmetric version of ADMM with larger step sizes
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Multiplier and gradient methods
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- Solving constrained total-variation image restoration and reconstruction problems via alternating direction methods
- Strong convergence of an extragradient-like algorithm involving pseudo-monotone mappings
Cited in
(9)- Convergence rate of a unified prediction-correction algorithm for linearly constrained equilibrium problems
- A note on the convergence of alternating proximal gradient method
- A contraction method with proximal regularization for linearly constrained convex optimization problem with separable structures
- Self-adaptive inertial extragradient algorithms for solving variational inequality problems
- Linear and superlinear convergence of an inexact algorithm with proximal distances for variational inequality problems
- A modified proximal point algorithm for a nearly asymptotically quasi-nonexpansive mapping with an application
- A modified proximal point algorithm involving nearly asymptotically quasi-nonexpansive mappings
- Alternating minimization methods for strongly convex optimization
- scientific article; zbMATH DE number 5077050 (Why is no real title available?)
This page was built for publication: An alternate minimization method beyond positive definite proximal regularization: convergence and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5244153)
