Pages that link to "Item:Q4504795"
From MaRDI portal
The following pages link to CSDP, A C library for semidefinite programming (Q4504795):
Displaying 50 items.
- An exact algorithm for graph partitioning (Q1942271) (← links)
- Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
- Maxi-Min discriminant analysis via online learning (Q1942698) (← links)
- Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization (Q1988893) (← links)
- Convex optimization under combinatorial sparsity constraints (Q2102824) (← links)
- On the inducibility of oriented graphs on four vertices (Q2138968) (← links)
- Maximum number of almost similar triangles in the plane (Q2144458) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- A class of spectral bounds for max \(k\)-cut (Q2181211) (← links)
- Sums of squares in Macaulay2 (Q2184805) (← links)
- Outer approximation with conic certificates for mixed-integer convex problems (Q2195682) (← links)
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM (Q2231040) (← links)
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation (Q2251137) (← links)
- Stable local dimensionality reduction approaches (Q2270841) (← links)
- Spectral dimensionality reduction for Bregman information (Q2279965) (← links)
- A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
- Minimum number of edges that occur in odd cycles (Q2312602) (← links)
- On fractional cut covers (Q2312658) (← links)
- Spectral bounds for graph partitioning with prescribed partition sizes (Q2328109) (← links)
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm (Q2354819) (← links)
- Computing sum of squares decompositions with rational coefficients (Q2378506) (← links)
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture (Q2385546) (← links)
- A sums-of-squares extension of policy iterations (Q2406948) (← links)
- An exact semidefinite programming approach for the max-mean dispersion problem (Q2410030) (← links)
- SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
- Extension of classical MDS to treat dissimilarities not satisfying axioms of distance (Q2452289) (← links)
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem (Q2453730) (← links)
- Exploiting semidefinite relaxations in constraint programming (Q2489123) (← links)
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube (Q2509737) (← links)
- Semidefinite programming relaxations and algebraic optimization in control (Q2512289) (← links)
- Copositivity cuts for improving SDP bounds on the clique number (Q2638373) (← links)
- Linear matrix inequalities in control systems with uncertainty (Q2660497) (← links)
- The State-of-the-Art in Conic Optimization Software (Q2802542) (← links)
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs (Q2802543) (← links)
- Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
- GpoSolver: a Matlab/C++ toolbox for global polynomial optimization (Q2815514) (← links)
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations (Q2826815) (← links)
- A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs (Q2835666) (← links)
- Exact Solution Methods for the k-Item Quadratic Knapsack Problem (Q2835673) (← links)
- Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
- Global Stability Analysis of Nonlinear Sampled-Data Systems Using Convex Methods (Q2863195) (← links)
- Numerical study of semidefinite bounds for the \(k\)-cluster problem (Q2883586) (← links)
- A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access (Q2892140) (← links)
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs (Q2897305) (← links)
- Hybrid Tools for Hybrid Systems – Proving Stability and Safety at Once (Q2945598) (← links)
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem (Q2958360) (← links)
- On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs (Q2978191) (← links)
- Balancing weight-balanced trees (Q3016214) (← links)
- Hypergraphs Do Jump (Q3081326) (← links)
