Cited in
(only showing first 100 items - show all)- A semidefinite programming approach to tensegrity theory and realizability of graphs
- Solving a class of semidefinite programs via nonlinear programming
- Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
- scientific article; zbMATH DE number 1302192 (Why is no real title available?)
- Dual versus primal-dual interior-point methods for linear and conic programming
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- Advances in Linear Matrix Inequality Methods in Control
- Lagrangian Dual Interior-Point Methods for Semidefinite Programs
- Block coordinate descent methods for semidefinite programming
- An optimal-storage approach to semidefinite programming using approximate complementarity
- Sums of squares based approximation algorithms for MAX-SAT
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
- scientific article; zbMATH DE number 1664574 (Why is no real title available?)
- LFTB: an efficient algorithm to bound linear fractional transformations
- Book drawings of complete bipartite 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
- Fastest mixing Markov chain on graphs with symmetries
- 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
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
- On semidefinite programming relaxations for the satisfiability problem
- Solving large-scale semidefinite programs in parallel
- Computational approaches to MAX-cut
- A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
- Sum of squares method for sensor network localization
- scientific article; zbMATH DE number 1757960 (Why is no real title available?)
- The Analytic Center Cutting Plane Method with Semidefinite Cuts
- Geometry of semidefinite Max-Cut relaxations via matrix ranks
- Stochastic second-order cone programming in mobile ad hoc networks
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results
- GMRES-accelerated ADMM for quadratic objectives
- A novel formulation of the max-cut problem and related algorithm
- CSDP
- SDPLIB
- SDPHA
- LFTB
- MAX-2-SAT
- SDPA
- SDPT3
- DSDP5
- SDPpack
- CHOMPACK
- CirCut
- QSDP
- SDPLR
- Max-AO
- LMITOOL
- MAXDET
- PENSDP
- SNLSDP
- lambda
- SPARSE-QR
- PICOS
- SpeeDP
- SDPARA
- SBmethod
- NOA
- Outward rotations
- LOLIB
- Optspace
- SDPNAL+
- CYCLADES
- QETLAB
- sdpt3r
- ADMM_QAP
- ramchoice
- ABIP
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- Stochastic nuclear outages semidefinite relaxations
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
- Fast linear iterations for distributed averaging
- A feasible method for optimization with orthogonality constraints
- 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
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Inexact non-interior continuation method for solving large-scale monotone SDCP
- scientific article; zbMATH DE number 1489802 (Why is no real title available?)
- 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
- A Spectral Bundle Method for Semidefinite Programming
- 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
- Discrete Transforms, Semidefinite Programming, and Sum-of-Squares Representations of Nonnegative Polynomials
- Bregman primal-dual first-order method and application to sparse semidefinite programming
- Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
This page was built for software: COL
