Pages that link to "Item:Q5936078"

The following pages link to A smoothing Gauss-Newton method for the generalized HLCP (Q5936078):

Displaying 14 items.

• A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function (Q290328) (← links)
• A linear complementarity model for multibody systems with frictional unilateral and bilateral constraints (Q362933) (← links)
• Kernel function based interior-point methods for horizontal linear complementarity problems (Q394593) (← links)
• A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← links)
• Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem (Q732130) (← links)
• A smoothing Levenberg-Marquardt method for the extended linear complementarity problem (Q965571) (← links)
• A self-adaptive trust region method for the extended linear complementarity problems (Q993286) (← links)
• A smoothing Newton method for semi-infinite programming (Q1777435) (← links)
• Parameter optimization in large-scale dynamical systems: A method of contractive mapping (Q1877727) (← links)
• The convergence of the modulus-based Jacobi (MJ) iteration method for solving horizontal linear complementarity problems (Q2140763) (← links)
• On convergence of the modulus-based matrix splitting iteration method for horizontal linear complementarity problems of \(H_+\)-matrices (Q2287601) (← links)
• A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems (Q2356344) (← links)
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems (Q2376364) (← links)
• The relaxation modulus-based matrix splitting iteration method for horizontal linear complementarity problems (Q2682723) (← links)