APPLICATION OF ERROR BOUNDS FOR CONVEX PROGRAMMING IN A LINEAR SPACE

被引：118

作者：

ROBINSON, SM ^{[1
]}

机构：

[1] UNIV WISCONSIN,MATH RES CTR,MADISON,WI 53706

来源：

SIAM JOURNAL ON CONTROL | 1975年 / 13卷 / 02期

关键词：

D O I：

10.1137/0313015

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

An error-bounding technique for convex programming, used by A. V. Fiacco and G. P. McCormick is extended to general spaces. This technique is then applied to prove a version of A. J. Hoffman's theorem for K-convex inequalities.

引用

页码：271 / 273

页数：3

共 8 条

[1] Fiacco A., 1990, NONLINEAR PROGRAMMIN
[2] ON APPROXIMATE SOLUTIONS OF SYSTEMS OF LINEAR INEQUALITIES
HOFFMAN, AJ
[J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS, 1952, 49 (04): : 263 - 265
[3] Levitin E.S., 1966, COMP MATH MATH PHYS+, V6, P787
[4] Levitin E.S., 1966, COMP MATH MATH PHYS+, V6, P1, DOI DOI 10.1016/0041-5553(66)90114-5
[5] Mangasarian O. L., 1969, NONLINEAR PROGRAMMIN
[6] NEUSTADT LW, 1970, NONLINEAR PROGRAMMIN, P323
[7] SLATER M, 1950, 403 COWL COMM DISC P
[8] SLATER M, 1951, RM676 RAND REP

← 1 →