DSDP5

swMATH4411MaRDI QIDQ16587FDOQ16587

Author name not available (Why is that?)

Described by source

• An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem

Cited In (28)

• A framework for solving mixed-integer semidefinite programs
• Minimizing the sum of many rational functions
• Maximizing the algebraic connectivity of meshed electrical pathways used as current return network
• Sampling algebraic varieties for sum of squares programs
• Sampling method for semidefinite programmes with non-negative Popov function constraints
• Optimal experiment design in a filtering context with application to sampled network data
• Algorithm 875
• Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
• Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
• Matrix-free convex optimization modeling
• Encoding dissimilarity data for statistical model building
• Computational experience with a SDP-based algorithm for maximum cut with limited unbalance
• A branch‐and‐price approach to k‐clustering minimum biclique completion problem
• Sum of squares method for sensor network localization
• Low-rank exploitation in semidefinite programming for control
• Interior-point method for nuclear norm approximation with application to system identification
• Conic mixed-integer rounding cuts
• k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach
• A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance
• Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
• Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
• Bregman primal-dual first-order method and application to sparse semidefinite programming
• A Newton-bracketing method for a simple conic optimization problem
• The state-of-the-art in conic optimization software
• On the Generation of Positivstellensatz Witnesses in Degenerate Cases
• Algorithm 925, parallel solver for semidefinite programming problem having sparse Schur complement matrix
• Generating cutting planes for mixed integer programming problems in a parallel computing environment
• Stability and stabilisation of a class of networked dynamic systems

This page was built for software: DSDP5