Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
From MaRDI portal
Publication:4943939
DOI10.1137/S1052623497328008zbMath0997.90059OpenAlexW2061607408MaRDI QIDQ4943939
Steven Benson, Xiong Zhang, Yinyu Ye
Publication date: 19 March 2000
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623497328008
Related Items
Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems, Sum of squares method for sensor network localization, An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results, Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations, A low-complexity zero-forcing beamformer design for multiuser MIMO systems via a dual gradient method, GMRES-Accelerated ADMM for Quadratic Objectives, DC Programming Approaches for BMI and QMI Feasibility Problems, A successive SDP-NSDP approach to a robust optimization problem in finance, A matrix generation approach for eigenvalue optimization, Semidefinite programming relaxations for graph coloring and maximal clique problems, On the solution of large-scale SDP problems by the modified barrier method using iterative solvers, Solving large-scale semidefinite programs in parallel, Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming, Stochastic nuclear outages semidefinite relaxations, Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions, SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances, A random attention and utility model, Linear optimization over homogeneous matrix cones, Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods, An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem, Solving graph equipartition SDPs on an algebraic variety, A preconditioned iterative interior point approach to the conic bundle subproblem, Book drawings of complete bipartite graphs, Location-aided routing with uncertainty in mobile ad hoc networks: a stochastic semidefinite programming approach, Semidefinite programming relaxations for the graph partitioning problem, A guide to conic optimisation and its applications, A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion, Sums of squares based approximation algorithms for MAX-SAT, Dual versus primal-dual interior-point methods for linear and conic programming, A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO), An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity, Semidefinite programming for discrete optimization and matrix completion problems, Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems, A parallel interior point decomposition algorithm for block angular semidefinite programs, Lagrangian smoothing heuristics for Max-cut, A feasible method for optimization with orthogonality constraints, Randomized heuristics for the Max-Cut problem, The trust region subproblem and semidefinite programming*, Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints, An improved semidefinite programming relaxation for the satisfiability problem, Semidefinite diagonal directions Monte Carlo algorithms for detecting necessary linear matrix inequality constraints, Fast linear iterations for distributed averaging, Identifying redundant linear constraints in systems of linear matrix inequality constraints, An efficient method for convex constrained rank minimization problems based on DC programming, A novel formulation of the max-cut problem and related algorithm, Block Coordinate Descent Methods for Semidefinite Programming, Computational Approaches to Max-Cut, An evaluation of semidefinite programming based approaches for discrete lot-sizing problems, Solving semidefinite programs using preconditioned conjugate gradients, A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems, Computational enhancements in low-rank semidefinite programming, Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations, Bregman primal-dual first-order method and application to sparse semidefinite programming, Stochastic second-order cone programming in mobile ad hoc networks, Exploiting special structure in semidefinite programming: a survey of theory and applications, Inexact non-interior continuation method for solving large-scale monotone SDCP, An ADMM-based interior-point method for large-scale linear programming, An inexact dual logarithmic barrier method for solving sparse semidefinite programs, A semidefinite optimization approach for the single-row layout problem with unequal dimensions, LFTB: an efficient algorithm to bound linear fractional transformations, Unnamed Item, SDPLIB 1.2, a library of semidefinite programming test problems, Semidefinite programming, Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
Uses Software
