In this paper we study the behavior of infeasible-interior-point-paths for solving horizontal linear complementarity problems that are sufficient in the sense of Cottle et al. (R.W. Cottle, J.-S. Pang, Venkateswaran, Linear Algebra Appl. 114/115 (1989) 231-249). We show that these paths converge to a central point of the set of solutions. It is also shown that these are analytic functions of the path parameter even at the limitpoint, if the complementarity problem has a strictly complementary solution, and have a simple branchpoint, if it is solveable, but has no strictly complementarity solution.
In this paper, we first present a brief infeasible interior-point method with full-Newton step for s...
10.1023/B:COAP.0000013059.84424.afComputational Optimization and Applications273269-283CPPP
Several interior-point continuation methods for the nonlinear complementarity problem are known. The...
In this paper we study the behavior of infeasible-interior-point-paths for solving horizontal linear...
An interior point method (IPM) defines a search direction at each interior point of the feasible reg...
An interior point method (IPM) defines a search direction at each interior point of the feasible reg...
In the first part of the thesis we focus on algorithms acting in the small neighborhood of the centr...
Abstract. We present a modified version of the infeasible-interiorpoint algorithm for monotone linea...
The authors studied in Preiss and Stoer (2003) the analyticity properties of infeasible-interior-poi...
In this talk, we present an infeasible Full-Newton-Step Interior-Point Method for Linear Complementa...
In this talk, we present an infeasible Full-Newton-Step Interior-Point Method for Linear Complementa...
Linear Complementarity Problems (LCPs) belong to the class of -complete problems. Therefore we canno...
This paper establishes the polynomial convergence of a new class of path-following methods for linea...
In this talk, we present an infeasible full Newton-step Interior-Point Method for Linear Complementa...
We consider a modication of a path-following infeasible-interior-point algorithm described by Wright...
In this paper, we first present a brief infeasible interior-point method with full-Newton step for s...
10.1023/B:COAP.0000013059.84424.afComputational Optimization and Applications273269-283CPPP
Several interior-point continuation methods for the nonlinear complementarity problem are known. The...
In this paper we study the behavior of infeasible-interior-point-paths for solving horizontal linear...
An interior point method (IPM) defines a search direction at each interior point of the feasible reg...
An interior point method (IPM) defines a search direction at each interior point of the feasible reg...
In the first part of the thesis we focus on algorithms acting in the small neighborhood of the centr...
Abstract. We present a modified version of the infeasible-interiorpoint algorithm for monotone linea...
The authors studied in Preiss and Stoer (2003) the analyticity properties of infeasible-interior-poi...
In this talk, we present an infeasible Full-Newton-Step Interior-Point Method for Linear Complementa...
In this talk, we present an infeasible Full-Newton-Step Interior-Point Method for Linear Complementa...
Linear Complementarity Problems (LCPs) belong to the class of -complete problems. Therefore we canno...
This paper establishes the polynomial convergence of a new class of path-following methods for linea...
In this talk, we present an infeasible full Newton-step Interior-Point Method for Linear Complementa...
We consider a modication of a path-following infeasible-interior-point algorithm described by Wright...
In this paper, we first present a brief infeasible interior-point method with full-Newton step for s...
10.1023/B:COAP.0000013059.84424.afComputational Optimization and Applications273269-283CPPP
Several interior-point continuation methods for the nonlinear complementarity problem are known. The...