Pages that link to "Item:Q1123139"
From MaRDI portal
The following pages link to A polynomial-time algorithm for a class of linear complementarity problems (Q1123139):
Displayed 50 items.
- An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem (Q279835) (← links)
- On a quadratic programming problem involving distances in trees (Q338937) (← links)
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function (Q451811) (← links)
- Enumeration of PLCP-orientations of the 4-cube (Q491752) (← links)
- On the complexity of computing the handicap of a sufficient matrix (Q644911) (← links)
- A FPTAS for computing a symmetric leontief competitive economy equilibrium (Q662291) (← links)
- A little theorem of the big \({\mathcal M}\) in interior point algorithms (Q687037) (← links)
- Exterior point algorithms for nearest points and convex quadratic programs (Q687081) (← links)
- On the finite convergence of interior-point algorithms for linear programming (Q687096) (← links)
- A long-step barrier method for convex quadratic programming (Q689102) (← links)
- Convergence behavior of interior-point algorithms (Q689124) (← links)
- Computational complexity of norm-maximization (Q757258) (← links)
- The relation between the path of centers and Smale's regularization of the linear programming problem (Q803732) (← links)
- Interior-point algorithms for global optimization (Q804475) (← links)
- O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming (Q805163) (← links)
- Algorithms for the solution of quadratic knapsack problems (Q806968) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions (Q858773) (← links)
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems (Q877592) (← links)
- Generalizations of the hidden Minkowski property (Q947672) (← links)
- A polynomial path-following interior point algorithm for general linear complementarity problems (Q989885) (← links)
- A new continuation method for complementarity problems with uniform P- functions (Q1121180) (← links)
- Interior path following primal-dual algorithms. II: Convex quadratic programming (Q1123122) (← links)
- A class of linear complementarity problems solvable in polynomial time (Q1174838) (← links)
- On some efficient interior point methods for nonlinear convex programming (Q1174840) (← 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)
- An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem (Q1181916) (← links)
- Unified complexity analysis for Newton LP methods (Q1184332) (← links)
- Complexity analysis of a linear complementarity algorithm based on a Lyapunov function (Q1184351) (← links)
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming (Q1188288) (← links)
- On affine scaling algorithms for nonconvex quadratic programming (Q1196182) (← links)
- On the convergence of the affine-scaling algorithm (Q1196183) (← links)
- An interior point potential reduction algorithm for the linear complementarity problem (Q1196718) (← links)
- Crashing a maximum-weight complementary basis (Q1196719) (← links)
- A polynomial method of approximate centers for linear programming (Q1196720) (← links)
- On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise (Q1206441) (← links)
- A new polynomial time method for a linear complementarity problem (Q1207309) (← links)
- On combined phase 1-phase 2 projective methods for linear programming (Q1207329) (← links)
- The linear complementarity problem, sufficient matrices, and the criss- cross method (Q1260955) (← links)
- An interior point method, based on rank-1 updates, for linear programming (Q1290600) (← links)
- A modified layered-step interior-point algorithm for linear programming (Q1290624) (← links)
- Symmetric primal-dual path-following algorithms for semidefinite programming (Q1294556) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
- An extension of the potential reduction algorithm for linear complementarity problems with some priority goals (Q1318200) (← links)
- Finding an interior point in the optimal face of linear programs (Q1319020) (← links)
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022) (← links)
- Global linear convergence of a path-following algorithm for some monotone variational inequality problems (Q1321256) (← links)