A Polynomial Interior-Point Algorithm for Monotone Linear Complementarity Problems

H. Mansouri; M. Pirhaji

doi:10.1007/s10957-012-0195-2

ScienceGate Book Chapters

JOURNAL ARTICLE

A Polynomial Interior-Point Algorithm for Monotone Linear Complementarity Problems

H. Mansouri M. Pirhaji

Year: 2012 Journal: Journal of Optimization Theory and Applications Vol: 157 (2)Pages: 451-461 Publisher: Springer Science+Business Media

DOI: 10.1007/s10957-012-0195-2

Get Full-Text PDF Get Analytical Report

Keywords:

Monotone polygon Linear complementarity problem Interior point method Complementarity (molecular biology) Mathematics Mixed complementarity problem Complementarity theory Algorithm Mathematical optimization Path (computing) Applied mathematics Computer science Nonlinear system Geometry

Metrics

Cited By

3.04

FWCI (Field Weighted Citation Impact)

Refs

0.90

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

Optimization and Variational Analysis

Physical Sciences → Computer Science → Computational Theory and Mathematics

A Polynomial Interior-Point Algorithm for Monotone Linear Complementarity Problems

Metrics

Citation History

Topics

Related Documents

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

An Infeasible Interior-point Algorithm for Monotone Linear Complementarity Problems

A New Polynomial Interior-Point Algorithm for Monotone Mixed Linear Complementarity Problem

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

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