Geodesic
An interior-point algorithm for semidefinite least-squares problems
Applications of Mathematics, Tome 67 (2022) no. 3, pp. 371-391 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

We propose a feasible primal-dual path-following interior-point algorithm for semidefinite least squares problems (SDLS). At each iteration, the algorithm uses only full Nesterov-Todd steps with the advantage that no line search is required. Under new appropriate choices of the parameter $\beta $ which defines the size of the neighborhood of the central-path and of the parameter $\theta $ which determines the rate of decrease of the barrier parameter, we show that the proposed algorithm is well defined and converges to the optimal solution of SDLS. Moreover, we obtain the currently best known iteration bound for the algorithm with a short-update method, namely, $\mathcal {O}(\sqrt {n}\log (n/\epsilon ))$. Finally, we report some numerical results to illustrate the efficiency of our proposed algorithm.
We propose a feasible primal-dual path-following interior-point algorithm for semidefinite least squares problems (SDLS). At each iteration, the algorithm uses only full Nesterov-Todd steps with the advantage that no line search is required. Under new appropriate choices of the parameter $\beta $ which defines the size of the neighborhood of the central-path and of the parameter $\theta $ which determines the rate of decrease of the barrier parameter, we show that the proposed algorithm is well defined and converges to the optimal solution of SDLS. Moreover, we obtain the currently best known iteration bound for the algorithm with a short-update method, namely, $\mathcal {O}(\sqrt {n}\log (n/\epsilon ))$. Finally, we report some numerical results to illustrate the efficiency of our proposed algorithm.
DOI : 10.21136/AM.2021.0217-20
Classification : 65K05, 90C22, 90C25, 90C51
Keywords: semidefinite least-squares problem; interior-point method; polynomial complexity 
@article{10_21136_AM_2021_0217_20,
     author = {Daili, Chafia and Achache, Mohamed},
     title = {An interior-point algorithm for semidefinite least-squares problems},
     journal = {Applications of Mathematics},
     pages = {371--391},
     year = {2022},
     volume = {67},
     number = {3},
     doi = {10.21136/AM.2021.0217-20},
     mrnumber = {4409311},
     zbl = {07547200},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/AM.2021.0217-20/}
}
TY  - JOUR
AU  - Daili, Chafia
AU  - Achache, Mohamed
TI  - An interior-point algorithm for semidefinite least-squares problems
JO  - Applications of Mathematics
PY  - 2022
SP  - 371
EP  - 391
VL  - 67
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/AM.2021.0217-20/
DO  - 10.21136/AM.2021.0217-20
LA  - en
ID  - 10_21136_AM_2021_0217_20
ER  - 
%0 Journal Article
%A Daili, Chafia
%A Achache, Mohamed
%T An interior-point algorithm for semidefinite least-squares problems
%J Applications of Mathematics
%D 2022
%P 371-391
%V 67
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/AM.2021.0217-20/
%R 10.21136/AM.2021.0217-20
%G en
%F 10_21136_AM_2021_0217_20
Daili, Chafia; Achache, Mohamed. An interior-point algorithm for semidefinite least-squares problems. Applications of Mathematics, Tome 67 (2022) no. 3, pp. 371-391. doi: 10.21136/AM.2021.0217-20

Cité par Sources :