scientific article; zbMATH DE number 4197759

MaRDI QIDQ5202851zbMATH OpenFDO

Authors Sanjay Mehrotra, Jie Sun

Publication date 1990

zbMATH Keywords

interior point algorithmsmooth convex programming

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Convex programming (90C25)

Recommendations

• An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
• Interior-point methods for convex programming
• scientific article; zbMATH DE number 800120
• A Practical Interior-Point Method for Convex Programming
• scientific article; zbMATH DE number 269555

Cited in

(11)

• 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
• An interior point parameterized central path following algorithm for linearly constrained convex programming
• 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
• 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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202851)