Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems
From MaRDI portal
Publication:4632727
DOI10.22436/jnsa.010.09.40zbMath1413.90207OpenAlexW2758344372MaRDI QIDQ4632727
Min Sun, Hongchun Sun, Y. J. Wang
Publication date: 30 April 2019
Published in: Journal of Nonlinear Sciences and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.22436/jnsa.010.09.40
Related Items (3)
Smoothing approximation to the lower order exact penalty function for inequality constrained optimization ⋮ An accelerated proximal augmented Lagrangian method and its application in compressive sensing ⋮ An inexact accelerated stochastic ADMM for separable convex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem
- An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems
- Generalized peaceman-Rachford splitting method for separable convex programming with applications to image processing
- Finite convergence of a projected proximal point algorithm for the generalized variational inequalities
- A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming
- An improved proximal alternating direction method for monotone variational inequalities with separable structure
- Structured linear algebra problems in adaptive optics imaging
- A class of linearized proximal alternating direction methods
- A fast splitting method tailored for Dantzig selector
- A new inexact alternating directions method for monotone variational inequalities
- Parameter selection for nonnegative $l_1$ matrix/tensor sparse decomposition
- A fast \(\ell_1\)-solver and its applications to robust face recognition
- Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- A customized proximal point algorithm for convex minimization with linear constraints
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming
- A hybrid LQP-based method for structured variational inequalities
- Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming
- A splitting method for separable convex programming
- A proximal partially parallel splitting method for separable convex programs
- A descent method for structured monotone variational inequalities
- Convex analysis and monotone operator theory in Hilbert spaces
- A distributed Douglas-Rachford splitting method for multi-block convex minimization problems
This page was built for publication: Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems
