A linear-time algorithm for the trust region subproblem based on hidden convexity

被引：0
|
作者：
Jiulin Wang
Yong Xia
机构：
[1] Beihang University,State Key Laboratory of Software Development Environment, LMIB of the Ministry of Education School of Mathematics and System Sciences
来源：
Optimization Letters | 2017年 / 11卷
关键词：
Trust region subproblem; Hidden convexity; Proximal gradient algorithm; Linear time complexity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We present a linear-time approximation scheme for solving the trust region subproblem (TRS). It employs Nesterov’s accelerated gradient descent algorithm to solve a convex programming reformulation of (TRS). The total time complexity is less than that of the recent linear-time algorithm. The algorithm is further extended to the two-sided trust region subproblem.
引用
收藏
页码：1639 / 1646
页数：7
相关论文
共 50 条
  • [21] An algorithm for solving new trust region subproblem with conic model
    Wang Jianyu
    Ni Qin
    SCIENCE IN CHINA SERIES A-MATHEMATICS, 2008, 51 (03): : 461 - 473
  • [22] On the branch and bound algorithm for the extended trust-region subproblem
    Karbasy, Saeid Ansary
    Salahi, Maziar
    JOURNAL OF GLOBAL OPTIMIZATION, 2022, 83 (02) : 221 - 233
  • [23] Solving trust-region subproblem augmented with linear inequality constraints
    Bergmann, Orjan
    Steihaug, Trond
    OPTIMIZATION METHODS & SOFTWARE, 2013, 28 (01): : 26 - 36
  • [24] Linear-time algorithm for the generation of trees
    Algorithmica (New York), 1997, 17 (02):
  • [25] A Linear-Time Algorithm for Seeds Computation
    Kociumaka, Tomasz
    Kubica, Marcin
    Radoszewski, Jakub
    Rytter, Wojciech
    Walen, Tomasz
    ACM TRANSACTIONS ON ALGORITHMS, 2020, 16 (02)
  • [26] A LINEAR-TIME ALGORITHM FOR SOLVING THE STRONG HIDDEN-LINE PROBLEM IN A SIMPLE POLYGON
    TOUSSAINT, GT
    PATTERN RECOGNITION LETTERS, 1986, 4 (06) : 449 - 451
  • [27] A LINEAR-TIME ALGORITHM FOR FINDING AN AMBITUS
    MISHRA, B
    TARJAN, RE
    ALGORITHMICA, 1992, 7 (5-6) : 521 - 554
  • [28] A linear-time algorithm for the generation of trees
    Alonso, L
    Remy, JL
    Schott, R
    ALGORITHMICA, 1997, 17 (02) : 162 - 182
  • [29] A linear-time majority tree algorithm
    Amenta, N
    Clarke, F
    John, KS
    ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2003, 2812 : 216 - 227
  • [30] A linear-time algorithm for the generation of trees
    L. Alonso
    J. L. Rémy
    R. Schott
    Algorithmica, 1997, 17 : 162 - 182
12345