Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
A polynomial path-following interior point algorithm for general linear complementarity problems
Path-following interior point algorithms for the Cartesian $P_{*}(\kappa )$-LCP over symmetric cones
NP-completeness of the linear complementarity problem
A unified approach to interior point algorithms for linear complementarity problems: A summary
A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
Linear systems in Jordan algebras and primal-dual interior-point algorithms
Extension of primal-dual interior point algorithms to symmetric cones
Similarity and other spectral relations for symmetric cones
Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
A generalized direction in interior point method for monotone linear complementarity problems
A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP_*(κ) horizontal linear complementarity problems over symmetric cones
On theP_*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones
An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones
Equivaence between different formulations of the linear complementarity promblem
A long-step interior-point algorithm for symmetric cone Cartesian P_*(κ)-HLCP
A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction
Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
Interior-point methods for CartesianP_*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions
Primal-dual entropy-based interior-point algorithms for linear optimization

This page was built for publication: Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations