An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem
DOI10.3934/jimo.2019104zbMath1474.90350OpenAlexW2978053374MaRDI QIDQ2031320
Jing Zhou, Cheng Lu, Ye Tian, Xiao-Ying Tang
Publication date: 9 June 2021
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2019104
branch-and-bound algorithmsimultaneous diagonalizationsemidefinite programming relaxationsecond-order cone programming relaxationtrust-region problem
Semidefinite programming (90C22) Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
- An adaptive trust region algorithm for large-residual nonsmooth least squares problems
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- A trust region method for nonsmooth convex optimization
- An intuitionistic fuzzy set based \(S^3\)VM model for binary classification with mislabeled information
- A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- Feasibility testing for systems of real quadratic equations
- Conic approximation to quadratic optimization with linear complementarity constraints
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- A Note on Polynomial Solvability of the CDT Problem
- Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants
- Polynomial Solvability of Variants of the Trust-Region Subproblem
- On Cones of Nonnegative Quadratic Functions
This page was built for publication: An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem
