An accelerated proximal augmented Lagrangian method and its application in compressive sensing (Q2412861): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 11:48, 18 December 2024

scientific article

Language	Label	Description	Also known as
English	An accelerated proximal augmented Lagrangian method and its application in compressive sensing	scientific article

Statements

scholarly article

0 references

An accelerated proximal augmented Lagrangian method and its application in compressive sensing (English)

0 references

0 references

0 references

Journal of Inequalities and Applications

0 references

publication date

27 October 2017

0 references

zbMATH Keywords

proximal augmented Lagrangian multiplier method

0 references

convex programming

0 references

global convergence

0 references

compressive sensing

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1186/s13660-017-1539-0

0 references

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

0 references

A customized proximal point algorithm for convex minimization with linear constraints

0 references

A class of customized proximal point algorithms for linearly constrained convex optimization

0 references

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

0 references

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

0 references

The symmetric ADMM with indefinite proximal regularization and its application

0 references

A proximal fully parallel splitting method for stable principal component pursuit

0 references

Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit

0 references

Smooth minimization of non-smooth functions

0 references

Multiplier and gradient methods

0 references

0 references

A new inexact alternating directions method for monotone variational inequalities

0 references

On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method

0 references

Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization

0 references

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

0 references

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

0 references

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

0 references

A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization

0 references

Hankel Matrix Rank Minimization with Applications to System Identification and Realization

0 references

The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization

0 references

An accelerated augmented Lagrangian method for linearly constrained convex programming with the rate of convergence \(O\left({1/{k^2}} \right)\)

0 references

Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning

0 references

Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1186/S13660-017-1539-0

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2412861

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2412861&oldid=39065766"