Pages that link to "Item:Q4339373"
From MaRDI portal
The following pages link to On Vaidya's Volumetric Cutting Plane Method for Convex Programming (Q4339373):
Displayed 13 items.
- Models and algorithms for distributionally robust least squares problems (Q403637) (← links)
- On the volumetric path (Q691484) (← links)
- Complexity of some cutting plane methods that use analytic centers (Q1352301) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- A utility theory based interactive approach to robustness in linear optimization (Q1753136) (← links)
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems (Q1815078) (← links)
- A note on approximation of a ball by polytopes (Q2386205) (← links)
- A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming (Q3015050) (← links)
- Polynomial Interior Point Cutting Plane Methods (Q4653547) (← links)
- First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems (Q5097011) (← links)
- On complexity of the translational-cut algorithm for convex minimax problems (Q5925720) (← links)
- Solving the discrete \(l_p\)-approximation problem by a method of centers (Q5936070) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)