The following pages link to (Q4496019):
Displaying 17 items.
- A nonmonotone GRASP (Q340011) (← links)
- Facial reduction algorithms for conic optimization problems (Q368590) (← links)
- A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570) (← links)
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming (Q1349146) (← links)
- Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints (Q1968617) (← links)
- Solving the 3d Ising model with the conformal bootstrap. II: \(c\)-minimization and precise critical exponents (Q2254895) (← links)
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm (Q2354819) (← links)
- Computing Gaussian \& exponential measures of semi-algebraic sets (Q2399890) (← links)
- A conversion of an SDP having free variables into the standard form SDP (Q2643612) (← links)
- Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems (Q2802536) (← links)
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization (Q4504791) (← links)
- Sdpha: a Matlab implementation of homogeneous interior-point algorithms for semidefinite programming (Q4504793) (← links)
- SDPLIB 1.2, a library of semidefinite programming test problems (Q4504799) (← links)
- Semidefinite and second-order cone optimization approach for the Toeplitz matrix approximation problem (Q5477513) (← links)
