Pages that link to "Item:Q1849262"
From MaRDI portal
The following pages link to Solving a class of semidefinite programs via nonlinear programming (Q1849262):
Displaying 15 items.
- On verified numerical computations in convex programming (Q849186) (← links)
- Large-scale semidefinite programming via a saddle point mirror-prox algorithm (Q868467) (← links)
- Efficient rank reduction of correlation matrices (Q875015) (← links)
- An inexact primal-dual path following algorithm for convex quadratic SDP (Q995786) (← links)
- Lower-order penalization approach to nonlinear semidefinite programming (Q995945) (← links)
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
- Local minima and convergence in low-rank semidefinite programming (Q2487849) (← links)
- Approximate augmented Lagrangian functions and nonlinear semidefinite programs (Q2505379) (← links)
- On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
- Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations (Q2826815) (← links)
- A sequential quadratic penalty method for nonlinear semidefinite programming (Q4470655) (← links)
- A sequential quadratic penalty method for nonlinear semidefinite programming (Q4470658) (← links)
- $LDL^T$ Direction Interior Point Method for Semidefinite Programming (Q4609469) (← links)
- Computational enhancements in low-rank semidefinite programming (Q5475287) (← links)
