Publication:5202851
From MaRDI portal
zbMath0725.90078MaRDI QIDQ5202851
Publication date: 1990
90C25: Convex programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
On complexity of the translational-cut algorithm for convex minimax problems, Solving the discrete \(l_p\)-approximation problem by a method of centers, 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, Interior-point methods for convex programming, Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming, A convergence analysis for a convex version of Dikin's algorithm, On the convergence of the method of analytic centers when applied to convex quadratic programs, On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands, The toll effect on price of anarchy when costs are nonlinear and asymmetric