The following pages link to Algorithm 875 (Q3549240):
Displaying 16 items.
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (Q621748) (← links)
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← 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)
- 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)
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs (Q2330644) (← links)
- The State-of-the-Art in Conic Optimization Software (Q2802542) (← links)
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs (Q2897305) (← 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)
- A branch‐and‐price approach to <i>k</i>‐clustering minimum biclique completion problem (Q4921257) (← links)
