Pages that link to "Item:Q650213"
From MaRDI portal
The following pages link to Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213):
Displayed 16 items.
- Derivatives of eigenvalues and Jordan frames (Q317127) (← links)
- A weighted-path-following method for symmetric cone linear complementarity problems (Q478931) (← links)
- Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity (Q1782218) (← links)
- On the convergence regions of generalized accelerated overrelaxation method for linear complementarity problems (Q1949575) (← links)
- A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds (Q2361520) (← links)
- A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem (Q2448176) (← links)
- An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem (Q2808306) (← links)
- A method for weighted projections to the positive definite cone (Q3453401) (← links)
- A Lipschitzian error bound for monotone symmetric cone linear complementarity problem (Q3453409) (← links)
- Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones (Q4559409) (← links)
- Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the Cartesian<b><i>P</i></b><sub>*</sub>(κ)-LCP Over Symmetric Cones (Q4979787) (← links)
- Infeasible path-following interior point algorithm for Cartesian <i>P</i><sub>*</sub>(κ) nonlinear complementarity problems over symmetric cones (Q5026485) (← links)
- Infeasible Mehrotra-type predictor–corrector algorithm for cartesian <i>P</i><sub>*</sub>(κ) nonlinear complementarity problems over symmetric cones (Q5031768) (← links)
- Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function (Q5038177) (← links)
- Full Nesterov–Todd step feasible interior-point method for the Cartesian<i>P</i><sub>*</sub>(κ)-SCLCP (Q5299915) (← links)
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions (Q5745170) (← links)