A NONINTERIOR CONTINUATION METHOD FOR QUADRATIC AND LINEAR PROGRAMMING

被引：20

作者：

Chen, Bintong ^{[1
]}

Harker, Patrick T. ^{[2
]}

机构：

[1] Washington State Univ, Coll Business & Econ, Dept Management & Syst, Pullman, WA 99164 USA

[2] Univ Penn, Wharton Sch, Dept Decis Sci, Philadelphia, PA 19104 USA

来源：

SIAM JOURNAL ON OPTIMIZATION | 1993年 / 3卷 / 03期

基金：

美国国家科学基金会;

关键词：

linear complementarity; quadratic programming; linear programming; continuation; interior point algorithms;

D O I：

10.1137/0803024

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The noninterior point path-following algorithm presented by the authors in 1990 is specialized to the mixed linear complementarity problem and its special cases (quadratic and linear programming). The new algorithm is related to, but has several advantages over, the interior point path-following algorithms.

引用

页码：503 / 515

页数：13

共 29 条

[1]

[Anonymous], 1981, PATHWAYS SOLUTIONS F

[2]

CHEN B., 1990, 901003 U PENNS DEC S

[3]

CHEN B., SIAM J MATR IN PRESS

[4]

CHEN B., MATH PROGRA IN PRESS

[5]

CHEN B., 1990, 901002 U PENNS DEC S

[6]

GOLDFARB D., 1988, ON3 L PRIMAL INTERIO

[7]

GONZAGA C. C., 1987, M8710 UCBERL COLL EN

[8] A DUAL DIFFERENTIABLE EXACT PENALTY-FUNCTION [J].

HAN, SP ;

MANGASARIAN, OL .

MATHEMATICAL PROGRAMMING, 1983, 25 (03) :293-306

[9] A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR-PROGRAMMING [J].

KARMARKAR, N .

COMBINATORICA, 1984, 4 (04) :373-395

[10] A POLYNOMIAL-TIME ALGORITHM FOR A CLASS OF LINEAR COMPLEMENTARITY-PROBLEMS [J].

KOJIMA, M ;

MIZUNO, S ;

YOSHISE, A .

MATHEMATICAL PROGRAMMING, 1989, 44 (01) :1-26

← 1 2 3 →