New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP
DOI10.1186/1029-242X-2013-285zbMath1282.90202OpenAlexW2135575410WikidataQ59301304 ScholiaQ59301304MaRDI QIDQ2436131
Guo-Qiang Wang, Xin-Zhong Cai, Min-Min Li, Yu-Jing Yue
Publication date: 21 February 2014
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/1029-242x-2013-285
linear complementarity probleminterior-point methodspolynomial complexityEuclidean Jordan algebraCartesian \(P_\ast ({\kappa})\)-property
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (3)
Cites Work
- 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
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- Monotone functions on formally real Jordan algebras
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions
- A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Self-regular functions and new search directions for linear and semidefinite optimization
- Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
- A generic primal–dual interior-point method for semidefinite optimization based on a new class of kernel functions
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions
- Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP
- A Jordan-algebraic approach to potential-reduction algorithms
This page was built for publication: New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP
