A unified approach to interior point algorithms for linear complementarity problems: A summary

Authors:
Masakazu Kojima;Nimrod Megiddo;Toshihito Noma;Akiko Yoshise
Affiliations:
Departments of Information Sciences and Systems Science, Tokyo Institute of Technology, Oh-Okayama, Meguro-ku, Tokyo 152, Japan;IBM Almaden Research Center, San Jose, CA 95120, USA and School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel;Department of Systems Science, Tokyo Institute of Technology, Oh-Okayama, Meguro-ku, Tokyo, 152, Japan;Graduate School of Systems Management, The University of Tsukuba, Otsuka, Bunkyo-ku, Tokyo, 112, Japan
Venue:
Operations Research Letters
Year:
1991

Citing 11
Cited 0

A new polynomial-time algorithm for linear programming

Combinatorica
A variation on Karmarkar's algorithm for solving linear programming problems

Mathematical Programming: Series A and B
A polynomial-time algorithm, based on Newton's method, for linear programming

Mathematical Programming: Series A and B
A primal-dual interior point algorithm for linear programming

Progress in Mathematical Programming Interior-point and related methods
Pathways to the optimal set in linear programming

on Progress in Mathematical Programming: Interior-Point and Related Methods
A polynomial-time algorithm for a class of linear complementary problems

Mathematical Programming: Series A and B
Interior path following primal-dual algorithms. Part I: Linear programming

Mathematical Programming: Series A and B
Interior path following primal-dual algorithms. Part II: Convex quadratic programming

Mathematical Programming: Series A and B
A centered projective algorithm for linear programming

Mathematics of Operations Research
An OnL iteration potential reduction algorithm for linear complementary problems

Mathematical Programming: Series A and B
An interior point potential reduction algorithm for the linear complementarity problem

Mathematical Programming: Series A and B

Quantified Score

Hi-index	0.00

Visualization

Abstract

This note summarizes a report with the same title, where a study was carried out regarding a unified approach, proposed by Kojima, Mizuno and Yoshise, for interior point algorithms for the linear complementarily problem with a positive semi-definite matrix. This approach is extended to nonsymmetric matrices with nonnegative principal minors.