Pages that link to "Item:Q1715729"
From MaRDI portal
The following pages link to The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems (Q1715729):
Displaying 16 items.
- Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones (Q828835) (← links)
- A modified LM algorithm for tensor complementarity problems over the circular cone (Q2043190) (← links)
- New convergence results of the modulus-based methods for vertical linear complementarity problems (Q2080888) (← links)
- Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems. (Q2128412) (← links)
- Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems (Q2219444) (← links)
- The matrix splitting iteration method for nonlinear complementarity problems associated with second-order cone (Q2657849) (← links)
- Optimality conditions for circular cone complementarity programs (Q5070613) (← links)
- Improved convergence analysis of a smoothing Newton method for the circular cone programming (Q5090294) (← links)
- A TWO-STEP MODULUS-BASED MULTISPLITTING ITERATION METHOD FOR THE NONLINEAR COMPLEMENTARITY PROBLEM (Q5858055) (← links)
- A relaxed two-step modulus-based matrix synchronous multisplitting iteration method for linear complementarity problems (Q6151976) (← links)
- A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems (Q6166658) (← links)
- General convergence results of the modulus-based methods for vertical nonlinear complementarity problems (Q6543778) (← links)
- Modulus-based synchronous multisplitting method for horizontal nonlinear complementarity problem (Q6584781) (← links)
- A two-step new modulus-based matrix splitting method for vertical linear complementarity problem (Q6586917) (← links)
- A two-step modulus-based matrix splitting iteration method without auxiliary variables for solving vertical linear complementarity problems (Q6593807) (← links)
- A relaxation two-step parallel modulus method without auxiliary variable for solving large sparse vertical linear complementarity problems (Q6660863) (← links)
