Smooth convex approximation to the maximum eigenvalue function
Smooth convex approximation to the maximum eigenvalue function
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 Rm to Sn, 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 Sn. 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.
matrix representation, spectral function, symmetric function, tikhonov regularization
253-270
Chen, Xin
927cf7ef-386c-42b5-aac4-c35836675619
Qi, Houduo
e9789eb9-c2bc-4b63-9acb-c7e753cc9a85
Qi, Liqun
69936be7-f1aa-4c1f-b403-5bd5f3ba7d4c
Teo, Kok-Lay
0123e020-bc8f-4d52-99a3-e1401b98b2b4
November 2004
Chen, Xin
927cf7ef-386c-42b5-aac4-c35836675619
Qi, Houduo
e9789eb9-c2bc-4b63-9acb-c7e753cc9a85
Qi, Liqun
69936be7-f1aa-4c1f-b403-5bd5f3ba7d4c
Teo, Kok-Lay
0123e020-bc8f-4d52-99a3-e1401b98b2b4
Chen, Xin, Qi, Houduo, Qi, Liqun and Teo, Kok-Lay
(2004)
Smooth convex approximation to the maximum eigenvalue function.
Journal of Global Optimization, 30 (2-3), .
(doi:10.1007/s10898-004-8271-2).
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 Rm to Sn, 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 Sn. 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.
This record has no associated files available for download.
More information
Published date: November 2004
Keywords:
matrix representation, spectral function, symmetric function, tikhonov regularization
Organisations:
Operational Research
Identifiers
Local EPrints ID: 29650
URI: http://eprints.soton.ac.uk/id/eprint/29650
ISSN: 0925-5001
PURE UUID: 127e8404-9ed7-4405-a783-b30caeda3f4a
Catalogue record
Date deposited: 11 May 2006
Last modified: 16 Mar 2024 03:41
Export record
Altmetrics
Contributors
Author:
Xin Chen
Author:
Liqun Qi
Author:
Kok-Lay Teo
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics