CSDP
From MaRDI portal
Cited in
(only showing first 100 items - show all)- An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- Linear matrix inequalities in control systems with uncertainty
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs
- Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization
- Sums of squares based approximation algorithms for MAX-SAT
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
- 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
- Engineering branch-and-cut algorithms for the equicut problem
- A robust algorithm for semidefinite programming
- 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
- Relaxation methods for navigation satellites set optimization
- An exact semidefinite programming approach for the max-mean dispersion problem
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- Towards Automatic Convergence Verification of Self-stabilizing Algorithms
- A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
- A new approximation algorithm for unrelated parallel machine scheduling with release dates
- A sums-of-squares extension of policy iterations
- On the maximum density of fixed strongly connected subtournaments
- Three-point bounds for energy minimization
- A parallel interior point decomposition algorithm for block angular semidefinite programs
- Provably near-optimal solutions for very large single-row facility layout problems
- A second-order cone cutting surface method: Complexity and application
- Computation of the Lasserre Ranks of Some Polytopes
- An extension of the elimination method for a sparse SOS polynomial
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- Semi-infinite programming using high-degree polynomial interpolants and semidefinite programming
- Numerical study of semidefinite bounds for the \(k\)-cluster problem
- Computing sum of squares decompositions with rational coefficients
- Towards Component Based Design of Hybrid Systems: Safety and Stability
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
- On verified numerical computations in convex programming
- Extension of classical MDS to treat dissimilarities not satisfying axioms of distance
- A new non-linear semidefinite programming algorithm with an application to multidisciplinary free material optimization
- Improving upper bounds for the clique number by non-valid inequalities
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- The Nesterov-Todd direction and its relation to weighted analytic centers
- Algorithm 875
- Reduction of symmetric semidefinite programs using the regular -representation
- Computational enhancements in low-rank semidefinite programming
- A hybrid constraint programming and semidefinite programming approach for the stable set problem
- Minimizing the number of 5-cycles in graphs with given edge-density
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- On the Lovász theta function and some variants
- Automating Verification of Cooperation, Control, and Design in Traffic Applications
- Approximating optimization problems over convex functions
- Semidefinite programming for discrete optimization and matrix completion problems
- Optimization and highly informative graph invariants
- scientific article; zbMATH DE number 2246591 (Why is no real title available?)
- New Turán densities for 3-graphs
- Real World Verification
- Visualizing network communities with a semi-definite programming method
- Abstract interpretation meets convex optimization
- Spectral bounds for graph partitioning with prescribed partition sizes
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
- Robust \(\mathcal H_2\) performance analysis and synthesis of linear polytopic discrete-time periodic systems via LMIs
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- Applications of semidefinite programming
- Supervised dimensionality reduction via sequential semidefinite programming
- Hypergraphs do jump
- On 3-hypergraphs with forbidden 4-vertex configurations
- New upper bounds for kissing numbers from semidefinite programming
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
- On using quadratic interpolation of the determinant function to estimate the step-length in a predictor-corrector variant for semidefinite programming
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- On filter-successive linearization methods for nonlinear semidefinite programming
- 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
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs
- Learning Dynamical Systems with Side Information
- A class of spectral bounds for max \(k\)-cut
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- On the inducibility of oriented graphs on four vertices
- Maximum number of almost similar triangles in the plane
- 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.
- Minimum number of edges that occur in odd cycles
- A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access
- Moment methods in energy minimization: new bounds for Riesz minimal energy problems
- Global solution of non-convex quadratically constrained quadratic programs
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- A Conic Programming Approach to Generalized Tchebycheff Inequalities
- Convex optimization under combinatorial sparsity constraints
- SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- scientific article; zbMATH DE number 5117490 (Why is no real title available?)
- PENNON: A code for convex nonlinear and semidefinite programming
- 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
- A non-linear arithmetic procedure for control-command software verification
- An independent benchmarking of SDP and SOCP solvers
- Extending the QCR method to general mixed-integer programs
- Sum-of-squares optimization without semidefinite programming
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
- An interior point constraint generation algorithm for semi-infinite optimization with health-care application
This page was built for software: CSDP
