scientific article; zbMATH DE number 4197759
From MaRDI portal
Publication:5202851
zbMath0725.90078MaRDI QIDQ5202851
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (11)
On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands ⋮ A convergence analysis for a convex version of Dikin's algorithm ⋮ The toll effect on price of anarchy when costs are nonlinear and asymmetric ⋮ An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming ⋮ A long-step barrier method for convex quadratic programming ⋮ On complexity of the translational-cut algorithm for convex minimax problems ⋮ Interior-point methods for convex programming ⋮ Solving the discrete \(l_p\)-approximation problem by a method of centers ⋮ On the convergence of the method of analytic centers when applied to convex quadratic programs ⋮ Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming ⋮ An interior point parameterized central path following algorithm for linearly constrained convex programming
This page was built for publication:
