Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/28959
Title: Smooth convex approximation to the maximum eigenvalue function
Authors: Chen, X
Qi, H
Qi, L 
Teo, KL
Keywords: Matrix representation
Spectral function
Symmetric function
Tikhonov regularization
Issue Date: 2004
Publisher: Kluwer Academic Publ
Source: Journal of global optimization, 2004, v. 30, no. 2, PIPS5118271, p. 253-270 How to cite?
Journal: Journal of global optimization 
Abstract: In this paper, we consider smooth convex approximations to the maximum eigenvalue function. To make it applicable to a wide class of applications, the study is conducted on the composite function of the maximum eigenvalue function and a linear operator mapping ℝ m to S n, the space of n-by-n symmetric matrices. The composite function in turn is the natural objective function of minimizing the maximum eigenvalue function over an affine space in S n. This leads to a sequence of smooth convex minimization problems governed by a smoothing parameter. As the parameter goes to zero, the original problem is recovered. We then develop a computable Hessian formula of the smooth convex functions, matrix representation of the Hessian, and study the regularity conditions which guarantee the nonsingularity of the Hessian matrices. The study on the well-posedness of the smooth convex function leads to a regularization method which is globally convergent.
URI: http://hdl.handle.net/10397/28959
ISSN: 0925-5001
EISSN: 1573-2916
DOI: 10.1007/s10898-004-8271-2
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

22
Last Week
0
Last month
1
Citations as of Sep 20, 2017

WEB OF SCIENCETM
Citations

21
Last Week
0
Last month
1
Citations as of Sep 21, 2017

Page view(s)

41
Last Week
4
Last month
Checked on Sep 24, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.