List of Articles مساله‌ی مکمل خطی ترکیبی

• Open Access Article
  • Abstract Page
  • Full-Text
  
  1 - A path-following feasible interior-point algorithm for mixed symmetric cone linear complementarity problems
  M. Zangiabadi H. Mansouri M. Pirhaji
  In this paper, we propose a feasible interior-point algorithm for mixed symmetric cone linear complementarity problems which are a general class of complementarity problems. The symmetrization of the search directions used in this paper is based on Nesterov and Todd sca More

  In this paper, we propose a feasible interior-point algorithm for mixed symmetric cone linear complementarity problems which are a general class of complementarity problems. The symmetrization of the search directions used in this paper is based on Nesterov and Todd scaling scheme. By using Euclidean Jordan algebra, we prove the convergence analysis of the proposed algorithm and show that the complexity bound of the algorithm matches the currently best known iteration bound for feasible interior-point methods. Manuscript profile