CONVEX QUADRATIC-PROGRAMMING WITH ONE CONSTRAINT AND BOUNDED VARIABLES

被引：41

作者：

DUSSAULT, JP

FERLAND, JA

LEMAIRE, B

机构：

[1] UNIV MONTREAL,DEPT INFORMAT & RECH OPERAT,MONTREAL H3C 3J7,QUEBEC,CANADA

[2] UNIV MONTPELLIER 2,UER MATH,F-34060 MONTPELLIER,FRANCE

来源：

MATHEMATICAL PROGRAMMING | 1986年 / 36卷 / 01期

关键词：

D O I：

10.1007/BF02591992

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：90 / 104

页数：15

共 13 条

[1] GOLDSTEIN-LEVITIN-POLYAK GRADIENT PROJECTION METHOD [J].

BERTSEKAS, DP .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1976, 21 (02) :174-183

[2]

Ciarlet PG, 1982, INTRO ANAL NUMERIQUE

[3]

Cottle R.W., 1972, MATHEMATICAL PROGRAM, V3, P210

[4]

DUSSAULT JP, 1982, THESIS U MONTREAL MO

[5]

FERLAND JA, 1978, PUBLICATION U MONTRE, V285

[6] CONVEX PROGRAMMING IN HILBERT SPACE [J].

GOLDSTEIN, AA .

BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1964, 70 (05) :709-&

[7] A POLYNOMIALLY BOUNDED ALGORITHM FOR A SINGLY CONSTRAINED QUADRATIC PROGRAM [J].

HELGASON, R ;

KENNINGTON, J ;

LALL, H .

MATHEMATICAL PROGRAMMING, 1980, 18 (03) :338-343

[8]

Levitin EC., 1966, COMP MATH MATH PHYS+, V6, P787, DOI DOI 10.1016/0041-5553(66)90114-5

[9]

MCCORD RK, 1979, SOL7920 STANF U DEP

[10] A NEW AND EFFICIENT ALGORITHM FOR A CLASS OF PORTFOLIO SELECTION-PROBLEMS [J].

PANG, JS .

OPERATIONS RESEARCH, 1980, 28 (03) :754-767

← 1 2 →