Pages that link to "Item:Q1196718"

The following pages link to An interior point potential reduction algorithm for the linear complementarity problem (Q1196718):

Displaying 35 items.

• Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
• A little theorem of the big \({\mathcal M}\) in interior point algorithms (Q687037) (← links)
• Interior-point algorithms for global optimization (Q804475) (← links)
• On total functions, existence theorems and computational complexity (Q808245) (← links)
• A class of linear complementarity problems solvable in polynomial time (Q1174838) (← links)
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569) (← links)
• A unified approach to interior point algorithms for linear complementarity problems: A summary (Q1180826) (← links)
• Comparative analysis of affine scaling algorithms based on simplifying assumptions (Q1181906) (← links)
• Complexity analysis of a linear complementarity algorithm based on a Lyapunov function (Q1184351) (← links)
• A new polynomial time method for a linear complementarity problem (Q1207309) (← links)
• A superlinearly convergent projection algorithm for solving the convex inequality problem (Q1271387) (← links)
• Investigation of path-following algorithms for signomial geometric programming problems (Q1280139) (← links)
• An extension of the potential reduction algorithm for linear complementarity problems with some priority goals (Q1318200) (← links)
• Global convergence in infeasible-interior-point algorithms (Q1334952) (← links)
• Extensions of the potential reduction algorithm for linear programming (Q1336068) (← links)
• Potential-reduction methods in mathematical programming (Q1361104) (← links)
• Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
• A smooth system of equations approach to complementarity problems for frictionless contacts (Q1666161) (← links)
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization (Q1677554) (← links)
• Near boundary behavior of primal-dual potential reduction algorithms for linear programming (Q1803608) (← links)
• Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems. (Q1807690) (← links)
• An interior point potential reduction method for constrained equations (Q1814789) (← links)
• Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence (Q1893347) (← links)
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem (Q1906276) (← links)
• The modulus-based matrix double splitting iteration method for linear complementarity problems (Q2004426) (← links)
• On hidden \(Z\)-matrix and interior point algorithm (Q2009197) (← links)
• On the convergence of two-step modulus-based matrix splitting iteration method (Q2134993) (← links)
• The convergence of modulus-based matrix splitting iteration methods for implicit complementarity problems (Q2141569) (← links)
• Improved error bounds based on \(\alpha (M)\) for the linear complementarity problem (Q2174476) (← links)
• Unique end of potential line (Q2194856) (← links)
• Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
• Pivoting in linear complementarity: Two polynomial-time cases (Q2391195) (← links)
• The convergence of a modulus-based matrix splitting iteration method for solving the implicit complementarity problems (Q2700131) (← links)
• Interior-point methods for linear programming: a review (Q3150491) (← links)
• Unique End of Potential Line (Q5091211) (← links)