Smoothing technique and its applications in semidefinite optimization (Q879964): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10107-006-0001-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2088411705 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Twice Differentiable Spectral Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Smooth minimization of non-smooth functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Excessive Gap Technique in Nonsmooth Convex Minimization / rank | |||
Normal rank |
Latest revision as of 18:48, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Smoothing technique and its applications in semidefinite optimization |
scientific article |
Statements
Smoothing technique and its applications in semidefinite optimization (English)
0 references
10 May 2007
0 references
The author extends the smoothing technique he has developed in two previous papers to the problems of semidefinite optimization. First (in Section 2) a simple technique is proposed for estimating the Lipschitz constant for the gradient of some symmetric function of eigenvalues of symmetric matrices. Then (in Section 3) an optimal method is described for solving a smooth convex optimization problem. This method will be used in the next sections for treating two applications, namely, the minimizations of the maximal eigenvalue and of the spectral radius of a symmetric matrix depending linearly on the design variables. For each of these problems an upper bound is given on the number of iterations. For the first application this number is bounded by O(\(1/\varepsilon\)) where \(\varepsilon\) is the required absolute accuracy of the problem while for the second one, this number is bounded by \((4/\delta)\sqrt{(1+\delta)r \log{r}}\) where \(\delta\) is the required relative accuracy and \(r\) is the maximal rank of the corresponding linear matrix. In particular, the latter method is a fully polynomial approximation scheme.
0 references
Convex optimization
0 references
Non-smooth optimization
0 references
Complexity theory
0 references
Smoothing technique
0 references