A weighted-path-following method for the linear complementarity problem
From MaRDI portal
Recommendations
- A weighted-path-following method for symmetric cone linear complementarity problems
- An implementing weighted path-following algorithm for linear complementarity problems
- A weighted-path-following method for monotone horizontal linear complementarity problem
- Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem
- Path-following algorithms for monotone weighted complementarity problems
Cited in
(29)- An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- A generalized direction in interior point method for monotone linear complementarity problems
- A logarithmic barrier interior-point method based on majorant functions for second-order cone programming
- A full-Newton step interior-point method for monotone weighted linear complementarity problems
- A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP
- The PMCGAOR and PMCSSOR methods for solving linear complementarity problems
- Complexity analysis of a weighted-full-Newton step interior-point algorithm for P_*()-LCP
- A weighted-path-following method for monotone horizontal linear complementarity problem
- A logarithmic barrier approach for linear programming
- An implementing weighted path-following algorithm for linear complementarity problems
- Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem
- Path-following algorithms for monotone weighted complementarity problems
- Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming
- A weighted-path-following method for symmetric cone linear complementarity problems
- A polynomial-time weighted path-following interior-point algorithm for linear optimization
- A weighted-path-following method for linear optimization
- Weighted-path-following algorithm for linear programming
- scientific article; zbMATH DE number 4183197 (Why is no real title available?)
- Path-following interior-point algorithm for monotone linear complementarity problems
- Interior-point algorithm for linear programming based on a new descent direction
- A Newton descent logarithmic barrier interior-point algorithm for monotone LCP
- A theoretical and numerical study of an interior-point algorithm for convex quadratic semidefinite optimization
- A full-Newton step feasible interior-point algorithm for the special weighted linear complementarity problems based on algebraic equivalent transformation
- A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
- A numerical study of an infeasible primal-dual path-following algorithm for linear programming
- Some non-interior path-following methods based on a scaled central path for linear complementarity problems
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
This page was built for publication: A weighted-path-following method for the linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5309480)
