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)

• 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
• Exact Solution Methods for the k-Item Quadratic Knapsack Problem
• Towards Component Based Design of Hybrid Systems: Safety and Stability
• Algorithm 875
• On verified numerical computations in convex programming
• Title not available (Why is that?)
• On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs
• Abstract interpretation meets convex optimization
• Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
• Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
• On the worst-case convergence of MR and CG for symmetric positive definite tridiagonal Toeplitz matrices
• Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
• A class of spectral bounds for max \(k\)-cut
• Minimum number of edges that occur in odd cycles
• Special issue: Third international conference on integration of artificial intelligence, and operations research techniques in constraint programming for combinatorial optimization problems (CPAIOR 2006), Cork, Ireland, May 31--June 2, 2006.Selected papers.
• Convex optimization under combinatorial sparsity constraints
• Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method
• A new branch-and-bound algorithm for standard quadratic programming problems
• Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming
• Monochromatic triangles in three-coloured graphs
• Noise reduction method for nonlinear signal based on maximum variance unfolding and its application to fault diagnosis
• Smaller SDP for SOS decomposition
• Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms
• Primal-Dual Interior-Point Methods for Semidefinite Programming in Finite Precision
• Stable local dimensionality reduction approaches
• Distance metric learning by minimal distance maximization
• A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
• Sufficient conditions for the synthesis ofH? fixed-order controllers
• Preprocessing sparse semidefinite programs via matrix completion
• Maxi-Min discriminant analysis via online learning
• Cardinality constrained minimum cut problems: complexity and algorithms.
• Rethinking Biased Estimation: Improving Maximum Likelihood and the Cramér–Rao Bound
• A team algorithm for robust stability analysis and control design of certain time-varying linear systems using piecewise quadratic Lyapunov functions
• Minimum Number of Monotone Subsequences of Length 4 in Permutations
• Avoiding numerical cancellation in the interior point method for solving semidefinite programs
• Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
• Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
• Implementation of a primal-dual method for SDP on a shared memory parallel architecture
• Optimization Schemes For Wireless Sensor Network Localization
• Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
• Outer approximation with conic certificates for mixed-integer convex problems
• Exploiting semidefinite relaxations in constraint programming
• Semidefinite programming relaxations and algebraic optimization in control
• On a matrix inequality and its application to the synchronization in coupled chaotic systems
• Norm bounds and underestimators for unconstrained polynomial integer minimization
• Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
• Title not available (Why is that?)
• Theory and Applications of Satisfiability Testing
• Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
• A convex relaxation bound for subgraph isomorphism
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Lagrangian Dual Interior-Point Methods for Semidefinite Programs
• A robust Lagrangian-DNN method for a class of quadratic optimization problems
• 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

This page was built for software: CSDP