A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem.
Cheng LuJitao MaZhibin DengWenxun XingPublished in: J. Glob. Optim. (2024)
Keyphrases
- branch and bound algorithm
- quadratic optimization
- lower bound
- branch and bound
- least squares
- upper bound
- optimal solution
- np hard
- upper bounding
- lower bounding
- finding an optimal solution
- combinatorial optimization
- precedence constraints
- randomly generated problems
- worst case
- single machine scheduling problem
- search algorithm
- mixed integer linear programming
- image processing
- primal dual
- max sat
- interior point methods
- objective function
- maximum clique
- machine learning