An infeasible-interior-point algorithm for linear complementarity problems

Stephen J. Wright

doi:10.1007/bf01582211

ScienceGate Book Chapters

JOURNAL ARTICLE

An infeasible-interior-point algorithm for linear complementarity problems

Stephen J. Wright

Year: 1994 Journal: Mathematical Programming Vol: 67 (1-3)Pages: 29-51 Publisher: Springer Science+Business Media

DOI: 10.1007/bf01582211

Get Full-Text PDF Get Analytical Report

Keywords:

Linear complementarity problem Mathematics Complementarity theory Interior point method Monotone polygon Mixed complementarity problem Algorithm Complementarity (molecular biology) Criss-cross algorithm Rate of convergence Coefficient matrix Convergence (economics) Numerical analysis Mathematical optimization Linear programming Applied mathematics Nonlinear system Mathematical analysis Computer science Linear-fractional programming Geometry

Metrics

Cited By

13.53

FWCI (Field Weighted Citation Impact)

Refs

0.99

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Matrix Theory and Algorithms

Physical Sciences → Computer Science → Computational Theory and Mathematics

Advanced Optimization Algorithms Research

Physical Sciences → Mathematics → Numerical Analysis

Optimization and Variational Analysis

Physical Sciences → Computer Science → Computational Theory and Mathematics

An infeasible-interior-point algorithm for linear complementarity problems

Metrics

Citation History

Topics

Related Documents

An Infeasible Interior-point Algorithm for Monotone Linear Complementarity Problems

An Adaptive Infeasible Interior-Point Algorithm for Linear Complementarity Problems

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

An Infeasible-Interior-Point Method for Linear Complementarity Problems

Infeasible interior point methods for sufficient linear complementarity problems