Modified cutting plane method for minimization of a convex function

被引：0
|
作者：
Pshenichnyi, BN
Nenakhov, EI
Kuz'menko, VN
机构：
来源：
CYBERNETICS AND SYSTEMS ANALYSIS | 1997年 / 33卷 / 06期
关键词：
Convex Function; Convex Program; Quadratic Programming Problem; Minimization Method; Nonsmooth Function;
D O I：
10.1007/BF02733226
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
[No abstract available]
引用
收藏
页码：867 / 873
页数：7
相关论文
共 50 条
  • [21] Mini-batch cutting plane method for regularized risk minimization
    Lu, Meng-long
    Qiao, Lin-bo
    Feng, Da-wei
    Li, Dong-sheng
    Lu, Xi-cheng
    [J]. FRONTIERS OF INFORMATION TECHNOLOGY & ELECTRONIC ENGINEERING, 2019, 20 (11) : 1551 - 1563
  • [22] Mini-batch cutting plane method for regularized risk minimization
    Meng-long Lu
    Lin-bo Qiao
    Da-wei Feng
    Dong-sheng Li
    Xi-cheng Lu
    [J]. Frontiers of Information Technology & Electronic Engineering, 2019, 20 : 1551 - 1563
  • [23] A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization
    Lee, Yin Tat
    Sidford, Aaron
    Wong, Sam Chiu-wai
    [J]. 2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2015, : 1049 - 1065
  • [24] A TILTED CUTTING PLANE PROXIMAL BUNDLE METHOD FOR CONVEX NONDIFFERENTIABLE OPTIMIZATION
    KIWIEL, KC
    [J]. OPERATIONS RESEARCH LETTERS, 1991, 10 (02) : 75 - 81
  • [25] VARIATIONS ON A CUTTING PLANE METHOD FOR SOLVING CONCAVE MINIMIZATION PROBLEMS WITH LINEAR CONSTRAINTS
    CABOT, AV
    [J]. NAVAL RESEARCH LOGISTICS, 1974, 21 (02) : 265 - 274
  • [26] A cutting-plane method without inclusions of approximating sets for conditional minimization
    Zabotin I.Y.
    Yarullin R.S.
    [J]. Lobachevskii Journal of Mathematics, 2015, 36 (2) : 132 - 138
  • [27] The Subgradient-Simplex Based Cutting Plane Method for Convex Hull Pricing
    Wang, Congcong
    Luh, Peter B.
    Gribik, Paul
    Zhang, Li
    Peng, Tengshun
    [J]. IEEE POWER AND ENERGY SOCIETY GENERAL MEETING 2010, 2010,
  • [28] An extended cutting plane method for a class of non-convex MINLP problems
    Westerlund, T
    Skrifvars, H
    Harjunkoski, I
    Porn, R
    [J]. COMPUTERS & CHEMICAL ENGINEERING, 1998, 22 (03) : 357 - 365
  • [29] Complexity analysis of an interior cutting plane method for convex-feasibility problems
    Goffin, JL
    Luo, ZQ
    Ye, YY
    [J]. SIAM JOURNAL ON OPTIMIZATION, 1996, 6 (03) : 638 - 652
  • [30] A nonlinear analytic center cutting plane method for a class of convex programming problems
    Mokhtarian, FS
    Goffin, JL
    [J]. SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (04) : 1108 - 1131
12345