Modified cutting plane method for minimization of a convex function

被引：0

作者：

B. N. Pshenichnyi

É. I. Nenakhov

V. N. Kuz’menko

机构：

来源：

Cybernetics and Systems Analysis | 1997年 / 33卷

关键词：

Convex Function; Convex Program; Quadratic Programming Problem; Minimization Method; Nonsmooth Function;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

下载

页码：867 / 873

页数：6

共 50 条

[1] Modified cutting plane method for minimization of a convex function
Pshenichnyi, BN
Nenakhov, EI
Kuz'menko, VN
CYBERNETICS AND SYSTEMS ANALYSIS, 1997, 33 (06) : 867 - 873
[2] Modified method of cutting-off for minimization of convex function
Pshenichnyj, B.N.
Nenakhov, E.I.
Kuz'menko, V.N.
Kibernetika i Sistemnyj Analis, (06): : 142 - 150
[3] Efficiency of the analytic center cutting plane method for convex minimization
Kiwiel, KC
SIAM JOURNAL ON OPTIMIZATION, 1997, 7 (02) : 336 - 346
[4] RELAXATIVE METHOD OF CONVEX FUNCTION MINIMIZATION
CHEPURNOY, ND
DOPOVIDI AKADEMII NAUK UKRAINSKOI RSR SERIYA A-FIZIKO-MATEMATICHNI TA TECHNICHNI NAUKI, 1982, (03): : 66 - 67
[5] A multipoint method of minimization of a convex function
É. I. Nenakhov
Cybernetics and Systems Analysis, 1999, 35 : 973 - 975
[6] Cutting plane methods based on the analytic barrier for minimization of a convex function subject to box-constraints
Beer, K
Skokov, VA
OPTIMIZATION METHODS & SOFTWARE, 2002, 17 (02): : 251 - 269
[7] A multipoint method of minimization of a convex function
Nenakhov, ÉI
CYBERNETICS AND SYSTEMS ANALYSIS, 1999, 35 (06) : 973 - 975
[8] THE CUTTING-PLANE METHOD FOR SOLVING CONVEX PROGRAMS
KELLEY, JE
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1960, 8 (04): : 703 - 712
[9] A modified alternating direction method for convex minimization problems
He, BS
Zhou, J
APPLIED MATHEMATICS LETTERS, 2000, 13 (02) : 123 - 130
[10] A MINIMIZATION METHOD FOR THE SUM OF A CONVEX FUNCTION AND A CONTINUOUSLY DIFFERENTIABLE FUNCTION
MINE, H
FUKUSHIMA, M
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1981, 33 (01) : 9 - 23

← 1 2 3 4 5 →