Pages that link to "Item:Q2706331"

The following pages link to A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems (Q2706331):

Displaying 22 items.

• Sufficient weighted complementarity problems (Q288407) (← links)
• Finite termination of a Newton-type algorithm for a class of affine variational inequality problems (Q613275) (← links)
• On the complexity of computing the handicap of a sufficient matrix (Q644911) (← links)
• On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems (Q811890) (← links)
• Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation (Q828652) (← links)
• Identifying the optimal partition in convex quadratic programming (Q924889) (← links)
• Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization (Q940836) (← links)
• Active constraint set invariancy sensitivity analysis in linear optimization (Q946305) (← links)
• A polynomial path-following interior point algorithm for general linear complementarity problems (Q989885) (← links)
• Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem (Q1021504) (← links)
• Analyticity of the central path at the boundary point in semidefinite programming (Q1848384) (← links)
• A rounding procedure for semidefinite optimization (Q2294267) (← links)
• Sensitivity analysis of linear programming in the presence of correlation among right-hand side parameters or objective function coefficients (Q2358161) (← links)
• Sensitivity analysis in linear optimization: invariant support set intervals (Q2572886) (← links)
• Refining the partition for multifold conic optimization problems (Q5151515) (← links)
• Support set expansion sensitivity analysis in convex quadratic optimization (Q5436923) (← links)
• Sensitivity analysis in convex quadratic optimization: invariant support set interval (Q5466704) (← links)
• Une procédure de purification pour les problèmes de complémentarité linéaire, monotones (Q5479841) (← links)
• A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution (Q5481687) (← links)
• On the identification of the optimal partition for semidefinite optimization (Q5882391) (← links)
• On the complexity of analyticity in semi-definite optimization (Q6118356) (← links)
• Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation (Q6491339) (← links)