The following pages link to DSDP5 (Q16587):
Displaying 28 items.
- Minimizing the sum of many rational functions (Q266410) (← links)
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (Q621748) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Sum of squares method for sensor network localization (Q839485) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- Optimal experiment design in a filtering context with application to sampled network data (Q977624) (← links)
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems (Q987509) (← links)
- Encoding dissimilarity data for statistical model building (Q993793) (← links)
- Maximizing the algebraic connectivity of meshed electrical pathways used as current return network (Q1997383) (← links)
- Bregman primal-dual first-order method and application to sparse semidefinite programming (Q2070334) (← links)
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm (Q2354819) (← links)
- The State-of-the-Art in Conic Optimization Software (Q2802542) (← links)
- Generating Cutting Planes for Mixed Integer Programming Problems in a Parallel Computing Environment (Q2890402) (← links)
- Matrix-Free Convex Optimization Modeling (Q2957708) (← links)
- Computational experience with a SDP-based algorithm for maximum cut with limited unbalance (Q3057151) (← links)
- On the Generation of Positivstellensatz Witnesses in Degenerate Cases (Q3088010) (← links)
- Low-rank exploitation in semidefinite programming for control (Q3119148) (← links)
- Algorithm 925 (Q3189662) (← links)
- A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance (Q3395019) (← links)
- Algorithm 875 (Q3549240) (← links)
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification (Q3584157) (← links)
- k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach (Q3630154) (← links)
- Sampling Algebraic Varieties for Sum of Squares Programs (Q4594913) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- A branch‐and‐price approach to <i>k</i>‐clustering minimum biclique completion problem (Q4921257) (← links)
- A Newton-bracketing method for a simple conic optimization problem (Q4999334) (← links)
- Stability and stabilisation of a class of networked dynamic systems (Q5027584) (← links)
- Sampling method for semidefinite programmes with non-negative Popov function constraints (Q5265682) (← links)
