Share Your Research, Maximize Your Social Impacts
A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs
Journal: Sahand Communications in Mathematical Analysis (Vol.14, No. 1)Publication Date: 2019-04-01
Authors : Ali Nakhaei Amroudi; Ali Reza Shojaeifard; Mojtaba Pirhaji;
Page : 127-146
Keywords : Mixed linear complementarity problem; Symmetric cone; Interior-point methods; Polynomial complexity;
Source : Download Find it from : Google Scholar
Abstract
An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and proved. Moreover, we obtain a polynomial time complexity bound which matches the currently best known iteration bound for infeasible interior-point methods.
Other Latest Articles
- Some Observations on Dirac Measure-Preserving Transformations and their Results
- A Class of Hereditarily $ell_p(c_0)$ Banach spaces
- Fuzzy Best Simultaneous Approximation of a Finite Numbers of Functions
- On the Linear Combinations of Slanted Half-Plane Harmonic Mappings
- Fekete-Szegö Problem of Functions Associated with Hyperbolic Domains
Last modified: 2019-04-28 14:13:45