Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
From MaRDI portal
Recommendations
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Semidefinite programming and combinatorial optimization
- An Interior-Point Method for Semidefinite Programming
Cited in
(82)- An optimal-storage approach to semidefinite programming using approximate complementarity
- Sums of squares based approximation algorithms for MAX-SAT
- A preconditioned iterative interior point approach to the conic bundle subproblem
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
- Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
- Semi-definite programming and quantum information
- LFTB: an efficient algorithm to bound linear fractional transformations
- Book drawings of complete bipartite graphs
- A parallel interior point decomposition algorithm for block angular semidefinite programs
- A unified pre-training and adaptation framework for combinatorial optimization on graphs
- Solving semidefinite programs using preconditioned conjugate gradients
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization
- Semidefinite programming
- A successive SDP-NSDP approach to a robust optimization problem in finance
- A matrix generation approach for eigenvalue optimization
- Restarting after branching in the SDP approach to MAX-CUT and similar combinatorial optimization problems
- Semidefinite programming relaxations for the graph partitioning problem
- An improved semidefinite programming relaxation for the satisfiability problem
- Linear optimization over homogeneous matrix cones
- Computational enhancements in low-rank semidefinite programming
- Semidefinite programming for discrete optimization and matrix completion problems
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Semidefinite diagonal directions Monte Carlo algorithms for detecting necessary linear matrix inequality constraints
- A guide to conic optimisation and its applications
- Solving Large Sparse Nonlinear Programs Using GRG
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
- Solving large-scale semidefinite programs in parallel
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs
- Computational approaches to MAX-cut
- Sum of squares method for sensor network localization
- Randomized heuristics for the Max-Cut problem
- SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Semidefinite programming based algorithms for the sparsest cut problem
- Stochastic second-order cone programming in mobile ad hoc networks
- SDPLIB 1.2, a library of semidefinite programming test problems
- An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results
- GMRES-accelerated ADMM for quadratic objectives
- A combinatorial, primal-dual approach to semidefinite programs
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- A novel formulation of the max-cut problem and related algorithm
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- Stochastic nuclear outages semidefinite relaxations
- Feasible and accurate algorithms for covering semidefinite programs
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
- Identifying redundant linear constraints in systems of linear matrix inequality constraints
- Fast linear iterations for distributed averaging
- A feasible method for optimization with orthogonality constraints
- A low-complexity zero-forcing beamformer design for multiuser MIMO systems via a dual gradient method
- An efficient method for convex constrained rank minimization problems based on DC programming
- Robust optimization of sums of piecewise linear functions with application to inventory problems
- The trust region subproblem and semidefinite programming*
- Inexact non-interior continuation method for solving large-scale monotone SDCP
- DC Programming Approaches for BMI and QMI Feasibility Problems
- An ADMM-based interior-point method for large-scale linear programming
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
- A random attention and utility model
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- Lagrangian smoothing heuristics for Max-cut
- Bregman primal-dual first-order method and application to sparse semidefinite programming
- Location-aided routing with uncertainty in mobile ad hoc networks: a stochastic semidefinite programming approach
- New approach to solve unconstrained binary quadratic problem
- IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming
- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs
- Loraine – an interior-point solver for low-rank semidefinite programming
- Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization
- Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions
- Graphical Lasso and thresholding: equivalence and closed-form solutions
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
- Dual versus primal-dual interior-point methods for linear and conic programming
- Solving graph equipartition SDPs on an algebraic variety
- Algorithm 1055: HDSDP: software for semidefinite programming
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials
- Subspace methods for nonlinear optimization
- Block coordinate descent methods for semidefinite programming
This page was built for publication: Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943939)
