Pages that link to "Item:Q4943939"
From MaRDI portal
The following pages link to Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization (Q4943939):
Displayed 24 items.
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- A matrix generation approach for eigenvalue optimization (Q868452) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers (Q868465) (← links)
- Solving large-scale semidefinite programs in parallel (Q868469) (← links)
- Sums of squares based approximation algorithms for MAX-SAT (Q944728) (← links)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
- Semidefinite programming (Q1600854) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- Semidefinite programming relaxations for the graph partitioning problem (Q1961466) (← links)
- Dual versus primal-dual interior-point methods for linear and conic programming (Q2467157) (← links)
- Lagrangian smoothing heuristics for Max-cut (Q2491324) (← links)
- Fast linear iterations for distributed averaging (Q2503645) (← links)
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions (Q2568330) (← links)
- LFTB: an efficient algorithm to bound linear fractional transformations (Q2575247) (← links)
- Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems (Q3156718) (← links)
- Randomized heuristics for the Max-Cut problem (Q4405937) (← links)
- SDPLIB 1.2, a library of semidefinite programming test problems (Q4504799) (← links)
- The trust region subproblem and semidefinite programming* (Q4673323) (← links)
- Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints (Q4674254) (← links)
- Identifying redundant linear constraints in systems of linear matrix inequality constraints (Q5446278) (← links)
- Solving semidefinite programs using preconditioned conjugate gradients (Q5460654) (← links)
- Computational enhancements in low-rank semidefinite programming (Q5475287) (← links)