A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P0LCPs
From MaRDI portal
Publication:4441944
DOI10.1137/S1052623401384151zbMath1039.90081WikidataQ57445519 ScholiaQ57445519MaRDI QIDQ4441944
Publication date: 19 January 2004
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
linear complementarity problem; Tikhonov regularization; regularized central path; \(P_0\)-matrix; non-interior-point algorithm
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C51: Interior-point methods
Related Items
A continuation method for linear complementarity problems withP0matrix, A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution, On solving linear complementarity problems by DC programming and DCA, The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function, A predictor-corrector smoothing Newton method for symmetric cone complementarity problems, Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem, Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem, Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search, A note on quadratic convergence of a smoothing Newton algorithm for the LCP, A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems, An exterior point polynomial-time algorithm for convex quadratic programming, Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP, An entire space polynomial-time algorithm for linear programming, Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem, A globally convergent non-interior point homotopy method for solving variational inequalities, A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs
