Pages that link to "Item:Q1176569"
From MaRDI portal
The following pages link to An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569):
Displaying 50 items.
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem (Q331977) (← links)
- A convergent algorithm for quantile regression with smoothing splines (Q672955) (← links)
- A little theorem of the big \({\mathcal M}\) in interior point algorithms (Q687037) (← 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)
- 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)
- A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions (Q858773) (← links)
- A class of linear complementarity problems solvable in polynomial time (Q1174838) (← 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)
- On lower bound updates in primal potential reduction methods for linear programming (Q1181907) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- On the complexity of following the central path of linear programs by linear extrapolation. II (Q1181914) (← links)
- An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem (Q1181916) (← links)
- Complexity analysis of a linear complementarity algorithm based on a Lyapunov function (Q1184351) (← links)
- A note on a potential reduction algorithm for LP with simultaneous primal-dual updating (Q1186945) (← 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)
- The linear complementarity problem, sufficient matrices, and the criss- cross method (Q1260955) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- An interior point algorithm for large scale portfolio optimization (Q1313173) (← links)
- An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (Q1315412) (← links)
- Interior point methods for optimal control of discrete time systems (Q1321328) (← links)
- A primal-dual affine-scaling potential-reduction algorithm for linear programming (Q1321668) (← links)
- On the solution and complexity of a generalized linear complementarity problem (Q1327430) (← links)
- A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
- Descent approaches for quadratic bilevel programming (Q1331096) (← links)
- Global convergence in infeasible-interior-point algorithms (Q1334952) (← links)
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
- Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
- Limiting behavior of weighted central paths in linear programming (Q1338144) (← links)
- Interior-point algorithms for monotone affine variational inequalities (Q1338552) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- On homogeneous and self-dual algorithms for LCP (Q1361111) (← links)
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs (Q1380924) (← links)
- EP theorems and linear complementarity problems (Q1392569) (← links)
- Average number of iterations of some polynomial interior-point -- algorithms for linear programming (Q1589768) (← 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)
- 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)
- Some variants of the Todd low-complexity algorithm (Q1904958) (← links)
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem (Q1906276) (← links)
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903) (← links)
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913) (← links)
