Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
type: Item
instance of: scholarly article
title: Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
zbMATH Open document ID: 1237.90235
published in: Science in China. Series A
publication date: 2009-12-07T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 5643474
zbMATH Keywords: Cartesian \(P_{*}(\kappa )\)-property
zbMATH Keywords: symmetric cone linear complementarity problem
zbMATH Keywords: path-following interior point algorithm
zbMATH Keywords: global convergence
zbMATH Keywords: complexity
author: Ziyan Luo
author: Naihua Xiu
MaRDI profile type: Publication
full work available at URL: s11425-008-0174-0
OpenAlex ID: W2009345006
cites work: Euclidean Jordan algebras and interior-point algorithms
cites work: Linear systems in Jordan algebras and primal-dual interior-point algorithms
cites work: A long-step primal--dual algorithm for the symmetric programming problem
cites work: An Interior‐Point Trust‐Region Algorithm for General Symmetric Cone Programming
cites work: On a commutative class of search directions for linear programming over symmetric cones
cites work: Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
cites work: Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
cites work: Extension of primal-dual interior point algorithms to symmetric cones
cites work: On implementing a primal-dual interior-point method for conic quadratic optimization
cites work: Jordan-algebraic aspects of nonconvex optimization over symmetric cones
cites work: An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints
cites work: Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
cites work: A homogeneous model for mixed complementarity problems over symmetric cones
cites work: Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary
cites work: Q4791203
cites work: A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
cites work: Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
cites work: Q5335379
cites work: Q4321748
DOI: 10.1007/S11425-008-0174-0
description: scientific article; zbMATH DE number 5643474