Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A proximal splitting method for separable convex programming and its application to compressive sensing

From MaRDI portal
Publication:3455368
Jump to:navigation, search

DOI10.22436/jnsa.009.02.05zbMath1327.90222OpenAlexW2782961608MaRDI QIDQ3455368

Hongchun Sun, Min Sun, Houchun Zhou

Publication date: 4 December 2015

Published in: Journal of Nonlinear Sciences and Applications (Search for Journal in Brave)

Full work available at URL: http://www.tjnsa.com/includes/files/articles/Vol9_Iss2_392--403_A_proximal_splitting_method_for_sep.pdf


zbMATH Keywords

compressive sensingseparable convex programmingproximal Peaceman-Rachford splitting method


Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)


Related Items (2)

The symmetric ADMM with indefinite proximal regularization and its application ⋮ A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming







This page was built for publication: A proximal splitting method for separable convex programming and its application to compressive sensing

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3455368&oldid=16776943"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 4 February 2024, at 20:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki