Recovering optimal solutions via SOC-SDP relaxation of trust region subproblem with nonintersecting linear constraints

DOI10.3934/JIMO.2018117zbMath1438.90379OpenAlexW2885565567MaRDI QIDQ2315597

Shu-Cherng Fang, Jinyu Dai, Wen-Xun Xing

Publication date: 25 July 2019

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2018117

zbMATH Keywords

matrix decompositiontrust region subproblemrecovering algorithmslater conditionSOC-SDP relaxation

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31)

Related Items (2)

A survey of hidden convex optimization ⋮ A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs

This page was built for publication: Recovering optimal solutions via SOC-SDP relaxation of trust region subproblem with nonintersecting linear constraints