CSDP

swMATH169MaRDI QIDQ12937FDOQ12937

Author name not available (Why is that?)

Described by source

• CSDP 2.3 user's guide
• CSDP, A C library for semidefinite programming

Cited In (only showing first 100 items - show all)

• Global Approaches for Facility Layout and VLSI Floorplanning
• On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization
• Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
• Sums of squares in Macaulay2
• A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
• Minimizing the sum of many rational functions
• Three-point bounds for energy minimization
• Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
• A new approximation algorithm for unrelated parallel machine scheduling with release dates
• Provably near-optimal solutions for very large single-row facility layout problems
• An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
• Numerical study of semidefinite bounds for the \(k\)-cluster problem
• Computing sum of squares decompositions with rational coefficients
• Extension of classical MDS to treat dissimilarities not satisfying axioms of distance
• Computational enhancements in low-rank semidefinite programming
• Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
• Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
• Global Stability Analysis of Nonlinear Sampled-Data Systems Using Convex Methods
• Algorithm 925
• Approximating optimization problems over convex functions
• Semidefinite relaxations for non-convex quadratic mixed-integer programming
• Semidefinite programming for discrete optimization and matrix completion problems
• Real World Verification
• New Turán densities for 3-graphs
• Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
• Navigating in a Graph by Aid of Its Spanning Tree Metric
• Robust \(\mathcal H_2\) performance analysis and synthesis of linear polytopic discrete-time periodic systems via LMIs
• New upper bounds for kissing numbers from semidefinite programming
• Applications of semidefinite programming
• Supervised dimensionality reduction via sequential semidefinite programming
• Solving Lift-and-Project Relaxations of Binary Integer Programs
• On filter-successive linearization methods for nonlinear semidefinite programming
• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
• A problem of Erdős and Sós on 3-graphs
• A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access
• A Conic Programming Approach to Generalized Tchebycheff Inequalities
• Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
• SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• PENNON: A code for convex nonlinear and semidefinite programming
• Title not available (Why is that?)
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• SDPLIB 1.2, a library of semidefinite programming test problems
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Worst-case CVaR based portfolio optimization models with applications to scenario planning
• AN EXTENSION OF THE ELIMINATION METHOD FOR A SPARSE SOS POLYNOMIAL(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions))
• An independent benchmarking of SDP and SOCP solvers
• An interior point constraint generation algorithm for semi-infinite optimization with health-care application
• Extending the QCR method to general mixed-integer programs
• Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks
• Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• A computational study for bilevel quadratic programs using semidefinite relaxations
• Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme
• Stochastic nuclear outages semidefinite relaxations
• Optimality and uniqueness of the \((4,10,1/6)\) spherical code
• Title not available (Why is that?)
• Separation and relaxation for cones of quadratic forms
• Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
• Conic mixed-integer rounding cuts
• A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
• Stabhyli
• Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation
• Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
• Similarity and other spectral relations for symmetric cones
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster
• Hypergraphs Do Jump
• On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
• Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
• Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
• A Solution to the 2/3 Conjecture
• Modularity-maximizing graph communities via mathematical programming
• Semidefinite relaxation for linear programs with equilibrium constraints
• Copositivity cuts for improving SDP bounds on the clique number
• Verification, Model Checking, and Abstract Interpretation
• On Convex Functions and the Finite Element Method
• Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
• Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity
• Block-diagonal semidefinite programming hierarchies for 0/1 programming
• Context-sensitive dependency pairs
• An exact algorithm for graph partitioning
• Successive linearization methods for nonlinear semidefinite programs
• Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
• Verifying Nonlinear Real Formulas Via Sums of Squares
• Semidefinite programming for uncertain linear equations in static analysis of structures
• Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
• An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
• Solving \(k\)-cluster problems to optimality with semidefinite programming
• A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs
• The State-of-the-Art in Conic Optimization Software
• A robust algorithm for semidefinite programming
• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• Sums of squares based approximation algorithms for MAX-SAT
• An exact semidefinite programming approach for the max-mean dispersion problem
• Proving Termination in the Context-Sensitive Dependency Pair Framework
• Relaxation methods for navigation satellites set optimization
• Computation of the Lasserre Ranks of Some Polytopes
• Robust Network Design with Uncertain Outsourcing Cost
• A parallel interior point decomposition algorithm for block angular semidefinite programs
• A second-order cone cutting surface method: Complexity and application

This page was built for software: CSDP