Stability and duality of non-convex problems via augmented Lagrangian

被引：0
|
作者：
Azimov, A.Y.
Gasimov, R.N.
机构：
来源：
Kibernetika i Sistemnyj Analiz | 2002年 / 03期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：120 / 130
相关论文
共 50 条
  • [41] STABILITY AND DUALITY IN CONVEX MINIMIZATION PROBLEMS
    JOLY, JL
    LAURENT, PJ
    REVUE FRANCAISE D INFORMATIQUE DE RECHERCHE OPERATIONNELLE, 1971, 5 (NR2): : 3 - &
  • [42] Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian
    Son, T. Q.
    Kim, D. S.
    Tam, N. N.
    JOURNAL OF GLOBAL OPTIMIZATION, 2012, 53 (02) : 165 - 184
  • [43] A duality theory for some non-convex functions of matrices
    Ekeland, Ivar
    RICERCHE DI MATEMATICA, 2006, 55 (01) : 1 - 12
  • [44] A duality theory for some non-convex functions of matrices
    Ivar Ekeland
    Ricerche di Matematica, 2006, 55 (1) : 1 - 12
  • [45] DUALITY IN MIXED INTEGER NON-CONVEX AND NONDIFFERENTIABLE PROGRAMMING
    CHANDRA, S
    CHANDRAMOHAN, M
    ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1979, 59 (04): : 205 - 209
  • [46] Convex approximations to sparse PCA via Lagrangian duality
    Luss, Ronny
    Teboulle, Marc
    OPERATIONS RESEARCH LETTERS, 2011, 39 (01) : 57 - 61
  • [47] EQUIVALENCE OF SADDLE-POINTS AND OPTIMA, AND DUALITY FOR A CLASS OF NON-SMOOTH NON-CONVEX PROBLEMS
    JEYAKUMAR, V
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1988, 130 (02) : 334 - 343
  • [48] CLASS OF NON-CONVEX OPTIMIZATION PROBLEMS
    HIRCHE, J
    TAN, HK
    ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1977, 57 (04): : 247 - 253
  • [49] Augmented Lagrangian Methods for Convex Matrix Optimization Problems
    Ying Cui
    Chao Ding
    Xu-Dong Li
    Xin-Yuan Zhao
    Journal of the Operations Research Society of China, 2022, 10 : 305 - 342
  • [50] Augmented Lagrangian Methods for Convex Matrix Optimization Problems
    Cui, Ying
    Ding, Chao
    Li, Xu-Dong
    Zhao, Xin-Yuan
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2022, 10 (02) : 305 - 342
12345