A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones

DOI10.1007/s40305-015-0094-yzbMath1327.90391OpenAlexW1680163914MaRDI QIDQ888311

Marzieh Sayadi Shahraki, Hossein Mansouri, Maryam Zangiabadi

Publication date: 30 October 2015

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-015-0094-y

zbMATH Keywords

wide neighborhoodinfeasible-interior-point methodsymmetric cone optimization\(P_*(\kappa )\)-property

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (3)

A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs ⋮ A wide neighborhood predictor–corrector infeasible-interior-point method for Cartesian P∗(κ)-LCP over symmetric cones ⋮ A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity

Cites Work

• Unnamed Item
• A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
• A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
• A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
• Euclidean Jordan algebras and interior-point algorithms
• Extension of primal-dual interior point algorithms to symmetric cones
• On a commutative class of search directions for linear programming over symmetric cones
• On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
• 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
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• Interior-point methods for CartesianP_*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions
• Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP_∗(κ)-LCP over symmetric cones
• Full Nesterov–Todd step feasible interior-point method for the CartesianP_*(κ)-SCLCP
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones

This page was built for publication: A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones