A polynomial path-following interior point algorithm for general linear complementarity problems

Tibor Illés; Marianna E.-Nagy; Tamás Terlaky

doi:10.1007/s10898-008-9348-0

ScienceGate Book Chapters

JOURNAL ARTICLE

A polynomial path-following interior point algorithm for general linear complementarity problems

Tibor Illés Marianna E.-Nagy Tamás Terlaky

Year: 2008 Journal: Journal of Global Optimization Vol: 47 (3)Pages: 329-342 Publisher: Springer Science+Business Media

DOI: 10.1007/s10898-008-9348-0

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Interior point method Linear complementarity problem Combinatorics Time complexity Path (computing) Complementarity (molecular biology) Polynomial Discrete mathematics Algorithm Mathematical analysis Computer science

Metrics

Cited By

0.93

FWCI (Field Weighted Citation Impact)

Refs

0.78

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Optimization Algorithms Research

Physical Sciences → Mathematics → Numerical Analysis

Matrix Theory and Algorithms

Physical Sciences → Computer Science → Computational Theory and Mathematics

Polynomial and algebraic computation

Physical Sciences → Computer Science → Computational Theory and Mathematics

A polynomial path-following interior point algorithm for general linear complementarity problems

Metrics

Citation History

Topics

Related Documents

Path-following interior-point algorithm for monotone linear complementarity problems

A path-following infeasible-interior-point algorithm for linear complementarity problems

A Polynomial Interior-Point Algorithm for Monotone Linear Complementarity Problems

Polynomial interior-point algorithm for P * ${(\kappa)}$ horizontal linear complementarity problems

Weighted-Path-Following Interior-Point Algorithm to Monotone Mixed Linear Complementarity Problem