An efficient splitting algorithm for solving the CDT subproblem

DOI10.1142/s0217595923500070zbMATH Open1548.90349MaRDI QIDQ6561567

Jinyu Dai

Publication date: 25 June 2024

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

branch-and-bounduniform distributioncutting planesecond-order cone constraints

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semidefinite relaxations for non-convex quadratic mixed-integer programming
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
• Quadratic optimization with two ball constraints
• On a subproblem of trust region algorithms for constrained optimization
• A hybrid algorithm for the two-trust-region subproblem
• Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
• On the complexity of quadratic programming with two quadratic constraints
• On globally solving the extended trust-region subproblems
• A Note on Polynomial Solvability of the CDT Problem
• A Two-Variable Approach to the Two-Trust-Region Subproblem
• Solving Generalized CDT Problems via Two-Parameter Eigenvalues
• Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
• New Results on Quadratic Minimization
• Consensus-ADMM for General Quadratically Constrained Quadratic Programming
• New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem
• Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints

This page was built for publication: An efficient splitting algorithm for solving the CDT subproblem