Pages that link to "Item:Q3142608"
From MaRDI portal
The following pages link to Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm (Q3142608):
Displaying 14 items.
- A new smoothing Broyden-like method for solving nonlinear complementarity problem with a \(P_{0}\)-function (Q652695) (← links)
- A note on generating \(P\)-matrices (Q691397) (← links)
- Generalized principal pivot transforms, complementarity theory and their applications in stochastic games (Q691469) (← links)
- A new smoothing and regularization Newton method for \(P_{0}\)-NCP (Q708899) (← links)
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (Q1275717) (← links)
- Solving linear systems involved in constrained optimization (Q1902118) (← links)
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems (Q1908927) (← links)
- A new class of smoothing functions and a smoothing Newton method for complementarity problems (Q1941192) (← links)
- A note on quadratic convergence of a smoothing Newton algorithm for the LCP (Q1941195) (← links)
- A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem (Q2448176) (← links)
- Enhanced intersection cutting-plane approach for linear complementarity problems (Q2565006) (← links)
- An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem (Q2808306) (← links)
- (Q4323620) (← links)
- A potential-reduction algorithm for linear complementarity problems (Q5697858) (← links)
