AN ITERATIVE ROW-ACTION METHOD FOR INTERVAL CONVEX-PROGRAMMING

被引：387
|
作者：
CENSOR, Y [1 ]
LENT, A [1 ]
机构：
[1] SUNY BUFFALO,DEPT COMP SCI,MED IMAGE PROC GRP,AMHERST,NY 14260
来源：
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS | 1981年 / 34卷 / 03期
关键词：
D O I：
10.1007/BF00934676
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：321 / 353
页数：33
相关论文
共 50 条
  • [21] REVERSE CONVEX-PROGRAMMING
    HILLESTAD, RJ
    JACOBSEN, SE
    APPLIED MATHEMATICS AND OPTIMIZATION, 1980, 6 (01): : 63 - 78
  • [22] AN ALGORITHM FOR CONVEX-PROGRAMMING
    HANSON, MA
    AUSTRALIAN JOURNAL OF STATISTICS, 1963, 5 (01): : 14 - 19
  • [23] A LOGARITHMIC BARRIER CUTTING PLANE METHOD FOR CONVEX-PROGRAMMING
    DENHERTOG, D
    KALISKI, J
    ROOS, C
    TERLAKY, T
    ANNALS OF OPERATIONS RESEARCH, 1995, 58 : 69 - 98
  • [24] A PRACTICAL INTERIOR-POINT METHOD FOR CONVEX-PROGRAMMING
    JARRE, F
    SAUNDERS, MA
    SIAM JOURNAL ON OPTIMIZATION, 1995, 5 (01) : 149 - 171
  • [25] Iterative Thresholding Framework for Row-Action Reconstruction from Sparse Projection Data
    Rashed, Essam A.
    Kudo, Hiroyuki
    2011 IEEE NUCLEAR SCIENCE SYMPOSIUM AND MEDICAL IMAGING CONFERENCE (NSS/MIC), 2011, : 4257 - 4259
  • [26] ON THE CONVERGENCE OF HAN METHOD FOR CONVEX-PROGRAMMING WITH QUADRATIC OBJECTIVE
    IUSEM, AN
    DEPIERRO, AR
    MATHEMATICAL PROGRAMMING, 1991, 52 (02) : 265 - 284
  • [27] APPLICATIONS OF THE METHOD OF PARTIAL INVERSES TO CONVEX-PROGRAMMING - DECOMPOSITION
    SPINGARN, JE
    MATHEMATICAL PROGRAMMING, 1985, 32 (02) : 199 - 223
  • [28] A NEW LINESEARCH METHOD FOR QUADRATICALLY CONSTRAINED CONVEX-PROGRAMMING
    MELMAN, A
    OPERATIONS RESEARCH LETTERS, 1994, 16 (02) : 67 - 77
  • [29] METHOD OF THE DESIGN AND VARIABLE MATRICES FOR THE CONVEX-PROGRAMMING PROBLEM
    IZHUTKIN, VS
    KOKURIN, MY
    IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENII MATEMATIKA, 1983, (05): : 78 - 80
  • [30] ON SHADOW PRICES IN CONVEX-PROGRAMMING
    MLYNAROVIC, V
    EKONOMICKO-MATEMATICKY OBZOR, 1988, 24 (02): : 201 - 214
12345