Pages that link to "Item:Q1567481"
From MaRDI portal
The following pages link to A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities (Q1567481):
Displaying 6 items.
- A second-order cone cutting surface method: Complexity and application (Q839677) (← links)
- An extension of Chubanov's algorithm to symmetric cones (Q1717223) (← links)
- A logarithmic barrier cutting plane method for convex programming (Q1904709) (← links)
- Solving variational inequalities defined on a domain with infinitely many linear constraints (Q2642631) (← links)
- An anlytic center self-concordant cut method for the convex feasibility problem. (Q2768059) (← links)
- Solving the discrete \(l_p\)-approximation problem by a method of centers (Q5936070) (← links)