A parallel best-response algorithm with exact line search for nonconvex sparsity-regularized rank minimization

Reference : A parallel best-response algorithm with exact line search for nonconvex sparsity-regu...


	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Electrical & electronics engineering
	Focus Areas :	Computational Sciences
	To cite this reference:	http://hdl.handle.net/10993/33772

Title :	A parallel best-response algorithm with exact line search for nonconvex sparsity-regularized rank minimization
Language :	English
Author, co-author :	Yang, Yang [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	Pesavento, Marius []
Publication date :	Apr-2018
Main document title :	Proc. 2018 IEEE International Conference on Acoustics, Speech and Signal
Peer reviewed :	Yes
Event name :	2018 IEEE International Conference on Acoustics, Speech and Signal (ICASSP)
Event date :	from 15-04-2018 to 20-04-2018
Permalink :	http://hdl.handle.net/10993/33772
Other URL :	https://arxiv.org/abs/1711.04489
Framework Programme / European Project :	H2020 ; 742648 - AGNOSTIC - Actively Enhanced Cognition based Framework for Design of Complex Systems

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	DictionaryLearning_ICASSP2018_final.pdf		Author postprint	126.52 kB	View/Open

Additional material(s):

	File	Commentary	Size	Access
Open access	main_file_ForPublic.m	updated on Feb 09, 2018	6.34 kB	View/Open

All documents in ORBi^lu are protected by a user license.