AQFC2015

Efficiency of l1-minimization for solving l0-minimization problems: Analysis via the range space property

--------------------------------------------------------------------------------

Department of Systems Engineering and Engineering Management
The Chinese University of Hong Kong

--------------------------------------------------------------------------------

Title: Efficiency of l1-minimization for solving l0-minimization problems: Analysis via the range space property

Speaker: Prof. Yun-Bin Zhao,
School of Mathematics, University of Birmingham
Date: June 25, 2014 (Wednesday)

Time: 4:00 PM to 5:00 PM

Venue: Room 513
William M.W. Mong Engineering Building (ERB)
(Engineering Building Complex Phase 2)
The Chinese University of Hong Kong.

Short Biography of the speaker:
Dr Yunbin Zhao received the PhD degree in 1998 from the Chinese Academy of Sciences (CAS). From June 1998 to February 2001 he was a postdoctoral research fellow with the Institute of Computational Mathematics at the CAS, and with the Department of SEEM, Chinese University of Hong Kong. From 2001 to 2007, he had been an assistant professor (2001-2003), and an associated professor at the CAS (2003-2007). From 2007 to 2013, he was a Lecturer at the University of Birmingham, England and a senior lecturer in the same university since 2013. His research interests include the operations research, computational optimization, convex analysis, numerical linear algebra, and their applications.

Abstract:
Many practical problems can be formulated as l0-minimization problems, which seek the sparse solution to a linear system. The recent study indicates that l1-minimization is efficient for solving L0-problems in many situations. From a mathematical point of view, however, the understanding of the relationship between l0- and L1-minimization remains incomplete. Their relationship can be further interpreted via the property of the range space of the transpose of the matrix, which provides an angle to completely characterize the uniqueness of l1-minimizers and the uniform recovery of all k-sparse signals. This analysis leads naturally to the concept of range space property of a matrix, which provides a broad understanding of the so-called equivalence and the strong equivalence between l0- and l1-minimization problems.

Everyone is invited to attend the talk.

The talk will be hosted by:
Prof. Duan Li,
Department of Systems Engineering and Engineering Management,
The Chinese University of Hong Kong,
E-mail: dli@se.cuhk.edu.hk
Telephone Number: (852) 3943-8323

For general enquiries, please contact the student coordinator:
Andy Chung,
Department of Systems Engineering and Engineering Management,
The Chinese University of Hong Kong,
E-mail: oychung@se.cuhk.edu.hk

SEEM-5202 Website: http://seminar.se.cuhk.edu.hk
Email: seem5202@se.cuhk.edu.hk

Date: 
Wednesday, June 25, 2014 - 08:00 to 09:00