Pages that link to "Item:Q2768059"
From MaRDI portal
The following pages link to An anlytic center self-concordant cut method for the convex feasibility problem. (Q2768059):
Displaying 4 items.
- An analytic center quadratic cut method for the convex quadratic feasibility problem (Q1396218) (← links)
- A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities (Q1567481) (← links)
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems (Q1815078) (← links)
- A homogenized cutting plane method to solve the convex feasibility problem. (Q2735076) (← links)