Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems (Q4632727): Difference between revisions

Latest revision as of 02:22, 19 July 2024

scientific article; zbMATH DE number 7049343

Language	Label	Description	Also known as
English	Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems	scientific article; zbMATH DE number 7049343

Statements

instance of

scholarly article

0 references

title

Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems (English)

0 references

0 references

0 references

0 references

Journal of Nonlinear Sciences and Applications

0 references

publication date

30 April 2019

0 references

zbMATH Keywords

alternating direction method of multipliers

0 references

Fortin and Glowinski's constant

0 references

global convergence

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.22436/jnsa.010.09.40

0 references

cites work

Structured linear algebra problems in adaptive optics imaging

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

0 references

Finite convergence of a projected proximal point algorithm for the generalized variational inequalities

0 references

Q3038523

0 references

Q3694624

0 references

Q4144736

0 references

A fast splitting method tailored for Dantzig selector

0 references

A distributed Douglas-Rachford splitting method for multi-block convex minimization problems

0 references

A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints

0 references

On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming

0 references

A new inexact alternating directions method for monotone variational inequalities

0 references

An implementable splitting algorithm for the $\ell_1$-norm regularized split feasibility problem

0 references

A splitting method for separable convex programming

0 references

Q4470274

0 references

A customized proximal point algorithm for convex minimization with linear constraints

0 references

A hybrid LQP-based method for structured variational inequalities

0 references

A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming

0 references

A fast $\ell_1$-solver and its applications to robust face recognition

0 references

Q5638112

0 references

An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems

0 references

Generalized peaceman-Rachford splitting method for separable convex programming with applications to image processing

0 references

Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA

0 references

A proximal partially parallel splitting method for separable convex programs

0 references

Parameter selection for nonnegative $l_1$ matrix/tensor sparse decomposition

0 references

Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming

0 references

A class of linearized proximal alternating direction methods

0 references

Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing

0 references

A descent method for structured monotone variational inequalities

0 references

An improved proximal alternating direction method for monotone variational inequalities with separable structure

0 references

Identifiers

zbMATH Open document ID

1413.90207

0 references

DOI

10.22436/jnsa.010.09.40

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4632727

@@ Property / full work available at URL @@
+https://doi.org/10.22436/jnsa.010.09.40
+Normal rank
@@ Property / OpenAlex ID @@
+W2758344372
@@ Property / OpenAlex ID: W2758344372 / rank @@
+Normal rank
@@ Property / cites work @@
+Structured linear algebra problems in adaptive optics imaging
+Normal rank
@@ Property / cites work @@
+Convex analysis and monotone operator theory in Hilbert spaces
+Normal rank
@@ Property / cites work @@
+Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
+Normal rank
@@ Property / cites work @@
+Finite convergence of a projected proximal point algorithm for the generalized variational inequalities
+Normal rank
@@ Property / cites work @@
+Q3038523
@@ Property / cites work: Q3038523 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3694624
@@ Property / cites work: Q3694624 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4144736
@@ Property / cites work: Q4144736 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast splitting method tailored for Dantzig selector
+Normal rank
@@ Property / cites work @@
+A distributed Douglas-Rachford splitting method for multi-block convex minimization problems
+Normal rank
@@ Property / cites work @@
+A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
+Normal rank
@@ Property / cites work @@
+On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming
+Normal rank
@@ Property / cites work @@
+A new inexact alternating directions method for monotone variational inequalities
+Normal rank
@@ Property / cites work @@
+An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem
+Normal rank
@@ Property / cites work @@
+A splitting method for separable convex programming
+Normal rank
@@ Property / cites work @@
+Q4470274
@@ Property / cites work: Q4470274 / rank @@
+Normal rank
@@ Property / cites work @@
+A customized proximal point algorithm for convex minimization with linear constraints
+Normal rank
@@ Property / cites work @@
+A hybrid LQP-based method for structured variational inequalities
+Normal rank
@@ Property / cites work @@
+A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming
+Normal rank
@@ Property / cites work @@
+A fast \(\ell_1\)-solver and its applications to robust face recognition
+Normal rank
@@ Property / cites work @@
+Q5638112
@@ Property / cites work: Q5638112 / rank @@
+Normal rank
@@ Property / cites work @@
+An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems
+Normal rank
@@ Property / cites work @@
+Generalized peaceman-Rachford splitting method for separable convex programming with applications to image processing
+Normal rank
@@ Property / cites work @@
+Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
+Normal rank
@@ Property / cites work @@
+A proximal partially parallel splitting method for separable convex programs
+Normal rank
@@ Property / cites work @@
+Parameter selection for nonnegative $l_1$ matrix/tensor sparse decomposition
+Normal rank
@@ Property / cites work @@
+Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming
+Normal rank
@@ Property / cites work @@
+A class of linearized proximal alternating direction methods
+Normal rank
@@ Property / cites work @@
+Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
+Normal rank
@@ Property / cites work @@
+A descent method for structured monotone variational inequalities
+Normal rank
@@ Property / cites work @@
+An improved proximal alternating direction method for monotone variational inequalities with separable structure
+Normal rank