A PARALLEL ALGORITHM FOR A CLASS OF CONVEX-PROGRAMS

被引:49
作者
HAN, SP
LOU, G
机构
[1] Univ of Illinois, United States
关键词
Computer Programming--Algorithms - Mathematical Programming; Linear - Mathematical Techniques--Iterative Methods - Optimization;
D O I
10.1137/0326019
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A parallel algorithm is proposed for minimizing q(x), where q is a uniformly convex function and x is an element of the intersection of C1, C2,..., Cm, which are closed convex sets in Rn.
引用
收藏
页码:345 / 355
页数:11
相关论文
共 9 条
[1]  
Fletcher R., 1981, PRACTICAL METHODS OP
[3]   SUPERLINEARLY CONVERGENT VARIABLE METRIC ALGORITHMS FOR GENERAL NONLINEAR-PROGRAMMING PROBLEMS [J].
HAN, SP .
MATHEMATICAL PROGRAMMING, 1976, 11 (03) :263-282
[4]  
HAN SP, IN PRESS MATH PROGRA
[5]  
HAN SP, IN PRESS MATH OPER R
[6]  
Ortega J. M., 1970, ITERATIVE SOLUTION N
[7]  
POWELL MJD, 1976, SURVEY MATH PROGRAMM, V1, P513
[8]   EXTENSION OF NEWTONS METHOD TO NONLINEAR FUNCTIONS WITH VALUES IN A CONE [J].
ROBINSON, SM .
NUMERISCHE MATHEMATIK, 1972, 19 (04) :341-&
[9]  
Rockafellar R. T., 1970, CONVEX ANAL