A boundary point method to solve semidefinite programs
From MaRDI portal
Publication:858180
DOI10.1007/s00607-006-0182-2zbMath1275.90055OpenAlexW2069572432MaRDI QIDQ858180
Angelika Wiegele, Janez Povh, Franz Rendl
Publication date: 8 January 2007
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-006-0182-2
Related Items
An SDP-based approach for computing the stability number of a graph, An adaptive accelerated first-order method for convex optimization, Douglas-Rachford splitting method for semidefinite programming, Matrix Relaxations in Combinatorial Optimization, Semidefinite programming and sums of Hermitian squares of noncommutative polynomials, An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming, An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem, New heuristics for the vertex coloring problem based on semidefinite programming, Semidefinite programming relaxations for graph coloring and maximal clique problems, SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning, Strong lift-and-project cutting planes for the stable set problem, A first-order block-decomposition method for solving two-easy-block structured semidefinite programs, Alternating direction augmented Lagrangian methods for semidefinite programming, An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs, Partitioning through projections: strong SDP bounds for large graph partition problems, BiqBin: Moving Boundaries for NP-hard Problems by HPC, Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems, Lower bounds on the global minimum of a polynomial, On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming, An introduction to a class of matrix cone programming, A guide to conic optimisation and its applications, \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM, A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming, A semidefinite programming-based heuristic for graph coloring, On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems, Optimizing a polyhedral-semidefinite relaxation of completely positive programs, A survey on conic relaxations of optimal power flow problem, Block Coordinate Descent Methods for Semidefinite Programming, Projection Methods in Conic Optimization, Using a factored dual in augmented Lagrangian methods for semidefinite programming, Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems, A proximal augmented method for semidefinite programming problems, Erratum to: ``On the solution of large-scale SDP problems by the modified barrier method using iterative solvers, On Solving the Quadratic Shortest Path Problem, NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials, An alternating direction method for solving convex nonlinear semidefinite programming problems, A novel approach for solving semidefinite programs, A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints, Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem
Uses Software
Cites Work
- Unnamed Item
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- Computing a nearest symmetric positive semidefinite matrix
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- An independent benchmarking of SDP and SOCP solvers
- On the Shannon capacity of a graph
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- A Dual Approach to Semidefinite Least-Squares Problems
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- Regularization Methods for Semidefinite Programming
- Solving Lift-and-Project Relaxations of Binary Integer Programs
