AN ELLIPSOID TRUST REGION BUNDLE METHOD FOR NONSMOOTH CONVEX MINIMIZATION

被引:18
|
作者
KIWIEL, KC
机构
关键词
D O I
10.1137/0327039
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
下载
收藏
页码:737 / 757
页数:21
相关论文
共 50 条
  • [21] A bundle-Newton method for nonsmooth unconstrained minimization
    Ladislav Lukšan
    Jan Vlček
    Mathematical Programming, 1998, 83 : 373 - 391
  • [22] Bundle-Newton method for nonsmooth unconstrained minimization
    Luksan, Ladislav
    Vlcek, Jan
    Mathematical Programming, Series A, 1998, 83 (03): : 373 - 391
  • [23] A bundle-Newton method for nonsmooth unconstrained minimization
    Luksan, L
    Vlcek, J
    MATHEMATICAL PROGRAMMING, 1998, 83 (03) : 373 - 391
  • [24] A doubly stabilized bundle method for nonsmooth convex optimization
    Welington de Oliveira
    Mikhail Solodov
    Mathematical Programming, 2016, 156 : 125 - 159
  • [25] A doubly stabilized bundle method for nonsmooth convex optimization
    de Oliveira, Welington
    Solodov, Mikhail
    MATHEMATICAL PROGRAMMING, 2016, 156 (1-2) : 125 - 159
  • [26] TRUST REGION METHOD IN NONSMOOTH OPTIMIZATION
    TERPOLILLI, P
    COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1995, 321 (07): : 945 - 948
  • [27] A Recursive Trust-Region Method for Non-Convex Constrained Minimization
    Gross, Christian
    Krause, Rolf
    DOMAIN DECOMPOSITION METHODS IN SCIENCE AND ENGINEERING XVIII, 2009, 70 : 137 - 144
  • [28] Bundle Enrichment Method for Nonsmooth Difference of Convex Programming Problems
    Gaudioso, Manlio
    Taheri, Sona
    Bagirov, Adil M.
    Karmitsa, Napsu
    ALGORITHMS, 2023, 16 (08)
  • [29] A bundle-filter method for nonsmooth convex constrained optimization
    Elizabeth Karas
    Ademir Ribeiro
    Claudia Sagastizábal
    Mikhail Solodov
    Mathematical Programming, 2009, 116 : 297 - 320
  • [30] A bundle-filter method for nonsmooth convex constrained optimization
    Karas, Elizabeth
    Ribeiro, Ademir
    Sagastizabal, Claudia
    Solodov, Mikhail
    MATHEMATICAL PROGRAMMING, 2009, 116 (1-2) : 297 - 320