Pages that link to "Item:Q2276879"
From MaRDI portal
The following pages link to On computing the center of a convex quadratically constrained set (Q2276879):
Displayed 3 items.
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (Q687091) (← links)
- A long-step barrier method for convex quadratic programming (Q689102) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
