Open AccessA SOCP relaxation based branch-and-bound method for generalized trust-region subproblem
Author(s) -
Jing Zhou,
Cheng Lu,
Ye Tian,
Wanrong Tang
Publication year - 2021
Publication title -
journal of industrial and management optimization
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.325
H-Index - 32
eISSN - 1553-166X
pISSN - 1547-5816
DOI - 10.3934/jimo.2019104
Subject(s) - relaxation (psychology) , diagonalizable matrix , upper and lower bounds , computer science , semidefinite programming , second order cone programming , mathematical optimization , relaxation technique , mathematics , matrix (chemical analysis) , algorithm , symmetric matrix , convex optimization , eigenvalues and eigenvectors , mathematical analysis , geometry , regular polygon , physics , medicine , psychology , social psychology , alternative medicine , materials science , quantum mechanics , pathology , composite material