A wide neighborhood predictor–corrector infeasible-interior-point method for Cartesian P∗(κ)-LCP over symmetric cones

DOI10.1142/S1793557116500492zbMath1346.90579OpenAlexW2260996180MaRDI QIDQ2818293

Maryam Zangiabadi, Marzieh Sayadi Shahraki, Hossein Mansouri

Publication date: 7 September 2016

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793557116500492

zbMATH Keywords

linear complementarity problemcentral pathwide neighborhoodpredictor-corrector infeasible-interior-point method

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Related Items (1)

A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs

Cites Work

• Unnamed Item
• A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones
• A homogeneous model for mixed complementarity problems over symmetric cones
• Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
• Function spaces and reproducing kernels on bounded symmetric domains
• A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity

This page was built for publication: A wide neighborhood predictor–corrector infeasible-interior-point method for Cartesian P∗(κ)-LCP over symmetric cones