ALGORITHMIC EQUIVALENCE IN QUADRATIC PROGRAMMING .1. LEAST-DISTANCE PROGRAMMING PROBLEM

被引：9

作者：

COTTLE, RW ^{[1
]}

DJANG, A ^{[1
]}

机构：

[1] UNIV KANSAS,SCH BUSINESS,LAWRENCE,KS 66045

来源：

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS | 1979年 / 28卷 / 03期

关键词：

algorithmic equivalence; Algorithms; least-distance problem; quadratic programming;

D O I：

10.1007/BF00933376

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

It is demonstrated that Wolfe's algorithm for finding the point of smallest Euclidean norm in a given convex polytope generates the same sequence of feasible points as does the van de Panne-Whinston symmetric algorithm applied to the associated quadratic programming problem. Furthermore, it is shown how the latter algorithm may be simplified for application to problems of this type. © 1979 Plenum Publishing Corporation.

引用

页码：275 / 301

页数：27