An efficient splitting algorithm for solving the CDT subproblem

DOI10.1142/S0217595923500070zbMATH Open1548.90349MaRDI QIDQ6561567FDOQ6561567

Authors: Jinyu Dai 

Publication date: 25 June 2024

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

zbMATH Keywords

uniform distributionbranch-and-boundcutting planesecond-order cone constraints

Mathematics Subject Classification ID

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

Cites Work

• New Results on Quadratic Minimization
• Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
• On a subproblem of trust region algorithms for constrained optimization
• Semidefinite relaxations for non-convex quadratic mixed-integer programming
• Title not available (Why is that?)
• Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
• Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
• A note on polynomial solvability of the CDT problem
• A two-variable approach to the two-trust-region subproblem
• Title not available (Why is that?)
• A hybrid algorithm for the two-trust-region subproblem
• On the complexity of quadratic programming with two quadratic constraints
• Solving generalized CDT problems via two-parameter eigenvalues
• Quadratic optimization with two ball constraints
• Consensus-ADMM for General Quadratically Constrained Quadratic Programming
• On maxima of dual function of the CDT subproblem
• On globally solving the extended trust-region subproblems
• New results on narrowing the duality gap of the extended Celis-Dennis-Tapia problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561567)