The following pages link to (Q5202851):
Displaying 11 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)
- Interior-point methods for convex programming (Q1205507) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- A convergence analysis for a convex version of Dikin's algorithm (Q1915918) (← links)
- An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
- On the convergence of the method of analytic centers when applied to convex quadratic programs (Q2277366) (← links)
- On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands (Q2389520) (← links)
- The toll effect on price of anarchy when costs are nonlinear and asymmetric (Q2462125) (← 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)
