Pages that link to "Item:Q1365057"
From MaRDI portal
The following pages link to Exploiting sparsity in primal-dual interior-point methods for semidefinite programming (Q1365057):
Displayed 15 items.
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers (Q868465) (← links)
- Sequential semidefinite program for maximum robustness design of structures under load uncertainty (Q868549) (← links)
- An inexact primal-dual path following algorithm for convex quadratic SDP (Q995786) (← links)
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721) (← links)
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming (Q1349146) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
- Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints (Q1968617) (← links)
- A potential reduction algorithm for an extended SDP problem (Q1974204) (← links)
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture (Q2385546) (← links)
- A conversion of an SDP having free variables into the standard form SDP (Q2643612) (← links)
- SDPLIB 1.2, a library of semidefinite programming test problems (Q4504799) (← links)
- Semidefinite programming and combinatorial optimization (Q5906394) (← links)