Pages that link to "Item:Q4389198"

The following pages link to Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path (Q4389198):

Displaying 9 items.

• Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem (Q376771) (← links)
• Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions (Q997220) (← links)
• A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
• Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path (Q2467158) (← links)
• A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems^* (Q2709447) (← links)
• A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS (Q2911579) (← links)
• (Q3057248) (← links)
• Hessian distances and their applications in the complexity analysis of interior-point methods (Q5299911) (← links)
• Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path (Q5312760) (← links)