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.
- Interior-point algorithms for monotone affine variational inequalities (Q1338552) (← links)
- A new method for a class of linear variational inequalities (Q1340052) (← links)
- Polynomiality of infeasible-interior-point algorithms for linear programming (Q1340070) (← links)
- Asymptotic convergence in a generalized predictor-corrector method (Q1352296) (← links)
- A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
- Fast convergence of the simplified largest step path following algorithm (Q1361106) (← links)
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling (Q1361107) (← links)
- The largest step path following algorithm for monotone linear complementarity problems (Q1363413) (← links)
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
- A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball (Q1376264) (← links)
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs (Q1380924) (← links)
- A sublinear parallel algorithm for stable matching (Q1575960) (← links)
- A continuation algorithm for a class of linear complementarity problems using an extrapolation technique (Q1801456) (← links)
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming (Q1803608) (← links)
- On the convergence of primal-dual interior-point methods with wide neighborhoods (Q1804577) (← links)
- Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems. (Q1807690) (← links)
- On well definedness of the central path (Q1807813) (← links)
- Containing and shrinking ellipsoids in the path-following algorithm (Q1813834) (← links)
- A class of smoothing functions for nonlinear and mixed complementarity problems (Q1815073) (← links)
- Strict feasibility conditions in nonlinear complementarity problems (Q1841578) (← links)
- New variants of the criss-cross method for linearly constrained convex quadratic programming (Q1877024) (← links)
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence (Q1893347) (← links)
- The curvature integral and the complexity of linear complementarity problems (Q1904662) (← links)
- A generalized homogeneous and self-dual algorithm for linear programming (Q1904760) (← links)
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem (Q1906276) (← links)
- A continuation method for monotone variational inequalities (Q1908015) (← links)
- A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems (Q1913863) (← links)
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903) (← links)
- An infeasible-interior-point algorithm using projections onto a convex set (Q1915905) (← links)
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913) (← links)
- Interior-point methods for nonlinear complementarity problems (Q1918290) (← links)
- A predictor-corrector method for extended linear-quadratic programming (Q1919785) (← links)
- Smoothing methods for convex inequalities and linear complementarity problems (Q1924058) (← links)
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060) (← links)
- Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem (Q2276889) (← links)
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach (Q2277159) (← links)
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
- Determination of optimal vertices from feasible solutions in unimodular linear programming (Q2366606) (← links)
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming (Q2368076) (← links)
- Improved complexity results on solving real-number linear feasibility problems (Q2490340) (← links)
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936) (← links)
- A polynomial-time algorithm for affine variational inequalities (Q2639604) (← links)
- An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (Q3444677) (← links)
- BIBLIOMETRIC OVERVIEW OF OPERATIONS RESEARCH/MANAGEMENT SCIENCE RESEARCH IN ASIA (Q3520514) (← links)
- A Polynomial Method of Weighted Centers for Convex Quadratic Programming (Q3976933) (← links)
- An alternative derivation of the projective interior point method for linear programming through the least squares approach (Q4764596) (← links)
- A quadratically convergent scaling newton’s method for nonlinear complementarity problems (Q4836762) (← links)
- A new potential reduction algorithm for smooth convex programming (Q4944415) (← links)
- Une procédure de purification pour les problèmes de complémentarité linéaire, monotones (Q5479841) (← links)
- General central path and the largest step general central path following algorithm for linear programming (Q5949520) (← links)