SBmethod
From MaRDI portal
Software:19727
swMATH7710MaRDI QIDQ19727FDOQ19727
Author name not available (Why is that?)
Cited In (10)
- On verified numerical computations in convex programming
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- Solving large-scale semidefinite programs in parallel
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints
- Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Semidefinite programming relaxations and algebraic optimization in control
- Title not available (Why is that?)
- Solving \(k\)-cluster problems to optimality with semidefinite programming
This page was built for software: SBmethod
