The following pages link to SBmethod (Q19727):
Displaying 10 items.
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- Solving large-scale semidefinite programs in parallel (Q868469) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints (Q2487469) (← links)
- Semidefinite programming relaxations and algebraic optimization in control (Q2512289) (← links)
- (Q4906149) (← links)
- Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation (Q5364279) (← links)
