Pages that link to "Item:Q5200552"
From MaRDI portal
The following pages link to Interior-point algorithms for a generalization of linear programming and weighted centring (Q5200552):
Displaying 14 items.
- A smoothing Newton algorithm for weighted linear complementarity problem (Q279815) (← links)
- Sufficient weighted complementarity problems (Q288407) (← links)
- The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra (Q670662) (← links)
- A smoothing Newton method with a mixed line search for monotone weighted complementarity problems (Q782310) (← links)
- A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPS (Q1993664) (← links)
- Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem (Q2044578) (← links)
- A nonmonotone smoothing Newton algorithm for weighted complementarity problem (Q2046534) (← links)
- A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem (Q2046555) (← links)
- A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem (Q2086935) (← links)
- A full-Newton step interior-point method for monotone weighted linear complementarity problems (Q2198532) (← links)
- A non-monotone inexact non-interior continuation method based on a parametric smoothing function for LWCP (Q4641578) (← links)
- A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems (Q5043856) (← links)
- Kernel-based full-Newton step feasible interior-point algorithm for \(P_* (\kappa)\)-weighted linear complementarity problem (Q6596330) (← links)
- Complexity analysis of a full-Newton step interior-point method for monotone weighted linear complementarity problems (Q6596331) (← links)