The following pages link to (Q5442492):
Displayed 23 items.
- QSDP (Q16894) (← links)
- On how to solve large-scale log-determinant optimization problems (Q288409) (← links)
- Newton's method for computing the nearest correlation matrix with a simple upper bound (Q620444) (← links)
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO (Q634734) (← links)
- An inexact spectral bundle method for convex quadratic semidefinite programming (Q694539) (← links)
- Block relaxation and majorization methods for the nearest correlation matrix with factor structure (Q763394) (← links)
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization (Q923998) (← links)
- An inexact primal-dual path following algorithm for convex quadratic SDP (Q995786) (← links)
- Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming (Q999796) (← links)
- A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization (Q1644574) (← links)
- A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming (Q1694389) (← links)
- Inexact SA method for constrained stochastic convex SDP and application in Chinese stock market (Q1709750) (← links)
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming (Q1741120) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics (Q2089080) (← links)
- A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming (Q2288182) (← links)
- Correlation stress testing for value-at-risk: an unconstrained convex optimization approach (Q2379691) (← links)
- Numerical solution of a class of quasi-linear matrix equations (Q2689160) (← links)
- Convergence of a weighted barrier algorithm for stochastic convex quadratic semidefinite optimization (Q2696952) (← links)
- A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization (Q3057532) (← links)
- A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond (Q5149523) (← links)
- On the low rank solution of the Q‐weighted nearest correlation matrix problem (Q5739764) (← links)
- Solving graph equipartition SDPs on an algebraic variety (Q6120843) (← links)