146 research outputs found
Recommended from our members
A superlinear infeasible-interior-point algorithm for monotone complementarity problems
We use the globally convergent framework proposed by Kojima, Noma, and Yoshise to construct an infeasible-interior-point algorithm for monotone nonlinear complementary problems. Superlinear convergence is attained when the solution is nondegenerate and also when the problem is linear. Numerical experiments confirm the efficacy of the proposed approach
Convergence analysis of an Inexact Infeasible Interior Point method for Semidefinite Programming
In this paper we present an extension to SDP of the well known infeasible Interior Point method for linear programming of Kojima,Megiddo and Mizuno (A primal-dual infeasible-interior-point algorithm for Linear Programming, Math. Progr., 1993). The extension developed here allows the use of inexact search directions; i.e., the linear systems defining the search directions can be solved with an accuracy that increases as the solution is approached. A convergence analysis is carried out and the global convergence of the method is prove
An Improved Predictor-Corrector Interior-Point Algorithm for Linear Complementarity Problems with -Iteration Complexity
This paper proposes an improved predictor-corrector interior-point algorithm for the linear complementarity problem (LCP) based on the Mizuno-Todd-Ye algorithm. The modified corrector steps in our algorithm cannot only draw the iteration point back to a narrower neighborhood of the center path but also reduce the duality gap. It implies that the improved algorithm can converge faster than the MTY algorithm. The iteration complexity of the improved algorithm is proved to obtain ā() which is similar to the classical Mizuno-Todd-Ye algorithm. Finally, the numerical experiments show that our algorithm improved the performance of the classical MTY algorithm
Superlinear convergence of an infeasible predictor-corrector path-following interior point algorithm for a semidefinite linear complementarity problem using the Helmberg-Kojima-Monteiro direction
2010-2011 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe
Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming
This paper establishes the superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming under the assumptions that the semidefinite program has a strictly complementary primal-dual optimal solution and that the size of the central path neighborhood tends to zero.
The interior point algorithm considered here closely resembles the Mizuno-Todd-Ye predictor-corrector method for linear programming which is known to be quadratically convergent.
It is shown that when the iterates are well centered, the duality gap is reduced superlinearly after each predictor step. Indeed, if each predictor step is succeeded by [TeX: ] consecutive corrector steps then the predictor reduces the duality gap superlinearly with order [TeX: ].
The proof relies on a careful analysis of the central path for semidefinite programming. It is shown that under the strict complementarity assumption, the primal-dual central path converges to the analytic center of the primal-dual optimal solution set, and the distance from any point on the central path to this analytic center is bounded by the duality gap
Some recent advances in projection-type methods for variational inequalities
AbstractProjection-type methods are a class of simple methods for solving variational inequalities, especially for complementarity problems. In this paper we review and summarize recent developments in this class of methods, and focus mainly on some new trends in projection-type methods
Global convergence enhancement of classical linesearch interior point methods for MCPs
AbstractRecent works have shown that a wide class of globally convergent interior point methods may manifest a weakness of convergence. Failures can be ascribed to the procedure of linesearch along the Newton step. In this paper, we introduce a globally convergent interior point method which performs backtracking along a piecewise linear path. Theoretical and computational results show the effectiveness of our proposal
- ā¦