Pages that link to "Item:Q1095806"

The following pages link to NP-completeness of the linear complementarity problem (Q1095806):

Displaying 50 items.

• Some LCPs solvable in strongly polynomial time with Lemke's algorithm (Q344960) (← links)
• Absolute value equation solution via linear programming (Q398653) (← links)
• A DC programming approach for solving the symmetric eigenvalue complementarity problem (Q429495) (← links)
• Enumeration of PLCP-orientations of the 4-cube (Q491752) (← links)
• A hybrid algorithm for solving the absolute value equation (Q499704) (← links)
• Combinatorial characterizations of \(K\)-matrices (Q609481) (← links)
• A globally and quadratically convergent method for absolute value equations (Q626654) (← links)
• A dynamic model to solve the absolute value equations (Q679569) (← links)
• Linear complementarity problems and multiple objective programming (Q689137) (← links)
• Primal-dual bilinear programming solution of the absolute value equation (Q694190) (← links)
• On the solution of NP-hard linear complementarity problems (Q699514) (← links)
• Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path (Q722338) (← links)
• Sign-solvable linear complementarity problems (Q929486) (← links)
• Existence theory and \(Q\)-matrix characterization for the generalized linear complementarity problem: Revisited (Q1001293) (← links)
• A generalized Newton method for absolute value equations (Q1001330) (← links)
• Knapsack feasibility as an absolute value equation solvable by successive linear programming (Q1024724) (← links)
• Gauss-Newton methods for the complementarity problem (Q1321346) (← links)
• Solving more linear complementarity problems with Murty's Bard-type algorithm (Q1321349) (← links)
• On the solution and complexity of a generalized linear complementarity problem (Q1327430) (← links)
• EP theorems and linear complementarity problems (Q1392569) (← links)
• Sufficient conditions for the unsolvability and solvability of the absolute value equation (Q1676495) (← links)
• An \((m+1)\)-step iterative method of convergence order \((m+2)\) for linear complementarity problems. An \((m+1)\)-step iterative method for LCPs (Q1676985) (← links)
• Total dual integrality of the linear complementarity problem (Q1730735) (← links)
• A generalization of the Gauss-Seidel iteration method for solving absolute value equations (Q1737146) (← links)
• A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) (← links)
• On an iterative method for solving absolute value equations (Q1758043) (← links)
• The linear complementarity problem as a separable bilinear program (Q1804582) (← links)
• Existence theory and \(Q\)-matrix characterization for the generalized linear complementarity problem (Q1894490) (← links)
• A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem (Q1939694) (← links)
• Absolute value equation solution via dual complementarity (Q1947610) (← links)
• On sufficient properties of sufficient matrices (Q2051181) (← links)
• Stability of the linear complementarity problem properties under interval uncertainty (Q2051193) (← links)
• Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique (Q2076907) (← links)
• A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem (Q2175368) (← links)
• A new SOR-like method for solving absolute value equations (Q2189704) (← links)
• Unique end of potential line (Q2194856) (← links)
• Complexity of near-optimal robust versions of multilevel optimization problems (Q2230787) (← links)
• On the structure of linear programs with overlapping cardinality constraints (Q2297664) (← links)
• Pivoting in linear complementarity: Two polynomial-time cases (Q2391195) (← links)
• Parameterized complexity of sparse linear complementarity problems (Q2408196) (← links)
• Counting unique-sink orientations (Q2434730) (← links)
• Linear complementarity as absolute value equation solution (Q2448218) (← links)
• Absolute value equation solution via concave minimization (Q2458899) (← links)
• A class of polynomially solvable linear complementarity problems (Q2492703) (← links)
• The eigenvalue complementarity problem (Q2643627) (← links)
• A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps (Q2657242) (← links)
• Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations (Q2672063) (← links)
• On Robust Solutions to Uncertain Linear Complementarity Problems and their Variants (Q2828336) (← links)
• The Linear Complementarity Problems with a Few Variables per Constraint (Q3465945) (← links)
• Minimum-support solutions of polyhedral concave programs^* (Q4265521) (← links)