Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B

DOI10.1007/S11590-022-01944-ZzbMATH Open1519.90152OpenAlexW4308326607MaRDI QIDQ6155645FDOQ6155645

Authors: Timotej Hrga, Janez Povh 

Publication date: 5 June 2023

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-022-01944-z

Recommendations

• A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
• Strengthened semidefinite programming relaxations for the max-cut problem.
• SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances

zbMATH Keywords

semidefinite programmingaugmented Lagrangian methodcutting-plane methodmax-cut problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Semidefinite programming (90C22)

Cites Work

• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• A Limited Memory Algorithm for Bound Constrained Optimization
• Regularization methods for semidefinite programming
• Title not available (Why is that?)
• Reducibility among combinatorial problems
• Computing a nearest symmetric positive semidefinite matrix
• Applications of cut polyhedra. II
• An Interior-Point Method for Semidefinite Programming
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Title not available (Why is that?)
• Improved semidefinite bounding procedure for solving max-cut problems to optimality
• A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring
• Computational approaches to MAX-cut
• A MAX-CUT formulation of 0/1 programs
• \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
• \texttt{EXPEDIS}: an exact penalty method over discrete sets
• Quantum annealing versus digital computing. An experimental comparison

Cited In (3)

• Title not available (Why is that?)
• Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization
• SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances

This page was built for publication: Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155645)