Abstract. This note points out an error in the local quadratic convergence proof of the predictor-corrector interior-point algorithm for solving the semidefinite linear complementarity problem based on the Alizadeh–Haeberly–Overton search direction presented in [M. Kojima, M. Shida, and S. Shin-doh, SIAM J. Optim., 9 (1999), pp. 444–465]. Their algorithm is slightly modified and the local quadratic convergence of the resulting method is established. Key words. semidefinite linear complementarity problem, semidefinite programming, interior-point algorithm, predictor-corrector algorithm, local quadratic convergenc
AP *-geometric linear complementarity problem (P *GP) as a generalization of the monotone geometric ...
This paper is concerned with an algorithm proposed by Alizadeh for linear semidefinite programming. ...
textabstractThis paper establishes the superlinear convergence of a symmetric primal-dual path follo...
. An example of SDPs (semidefinite programs) exhibits a substantial difficulty in proving the superl...
An interior point method (IPM) defines a search direction at each interior point of a region. These ...
A modified predictor-corrector algorithm is proposed for solving monotone linear complementarity pro...
In the first part of the thesis we focus on algorithms acting in the small neighborhood of the centr...
We study a predictor-corrector interior-point algorithm for solving general linear complementarity p...
We establishe the polynomial convergence of a new class of path-following methods for linear complem...
Kojima, Shindoh and Hara proposed a family of search directions for the semidefinite linear compleme...
We establishes the polynomial convergence of a new class of pathfollowing methods for semidefinite l...
We extend the Mizuno-Todd-Ye predictor-corrector algorithm for solving monotone linear complementary...
We analyze a version of the Mizuno-Todd-Ye predictor-corrector interior point algorithm for the -mat...
In this paper we present a generalization of the predictor corrector method of linear programming pr...
It has been shown in various papers that most interior-point algorithms and their analysis can be ge...
AP *-geometric linear complementarity problem (P *GP) as a generalization of the monotone geometric ...
This paper is concerned with an algorithm proposed by Alizadeh for linear semidefinite programming. ...
textabstractThis paper establishes the superlinear convergence of a symmetric primal-dual path follo...
. An example of SDPs (semidefinite programs) exhibits a substantial difficulty in proving the superl...
An interior point method (IPM) defines a search direction at each interior point of a region. These ...
A modified predictor-corrector algorithm is proposed for solving monotone linear complementarity pro...
In the first part of the thesis we focus on algorithms acting in the small neighborhood of the centr...
We study a predictor-corrector interior-point algorithm for solving general linear complementarity p...
We establishe the polynomial convergence of a new class of path-following methods for linear complem...
Kojima, Shindoh and Hara proposed a family of search directions for the semidefinite linear compleme...
We establishes the polynomial convergence of a new class of pathfollowing methods for semidefinite l...
We extend the Mizuno-Todd-Ye predictor-corrector algorithm for solving monotone linear complementary...
We analyze a version of the Mizuno-Todd-Ye predictor-corrector interior point algorithm for the -mat...
In this paper we present a generalization of the predictor corrector method of linear programming pr...
It has been shown in various papers that most interior-point algorithms and their analysis can be ge...
AP *-geometric linear complementarity problem (P *GP) as a generalization of the monotone geometric ...
This paper is concerned with an algorithm proposed by Alizadeh for linear semidefinite programming. ...
textabstractThis paper establishes the superlinear convergence of a symmetric primal-dual path follo...