A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems
From MaRDI portal
Publication:2706331
DOI10.1137/S1052623498336590zbMath1010.90082MaRDI QIDQ2706331
Cornelis Roos, Tamás Terlaky, Jiming Peng, Tibor Illés
Publication date: 19 March 2001
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
optimal partitionlinear complementarity problemsrounding proceduremaximally complementary solution\(P_*(\kappa)\) matriceserror bounds on the size of the variables
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
Sensitivity analysis of linear programming in the presence of correlation among right-hand side parameters or objective function coefficients ⋮ On the identification of the optimal partition for semidefinite optimization ⋮ Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation ⋮ Sufficient weighted complementarity problems ⋮ Finite termination of a Newton-type algorithm for a class of affine variational inequality problems ⋮ On the complexity of analyticity in semi-definite optimization ⋮ On the complexity of computing the handicap of a sufficient matrix ⋮ Identifying the optimal partition in convex quadratic programming ⋮ Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization ⋮ Refining the partition for multifold conic optimization problems ⋮ Active constraint set invariancy sensitivity analysis in linear optimization ⋮ Support set expansion sensitivity analysis in convex quadratic optimization ⋮ A polynomial path-following interior point algorithm for general linear complementarity problems ⋮ A rounding procedure for semidefinite optimization ⋮ Sensitivity analysis in convex quadratic optimization: invariant support set interval ⋮ Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem ⋮ Une procédure de purification pour les problèmes de complémentarité linéaire, monotones ⋮ A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution ⋮ Sensitivity analysis in linear optimization: invariant support set intervals ⋮ Analyticity of the central path at the boundary point in semidefinite programming ⋮ On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems
