scientific article
From MaRDI portal
Publication:3995706
zbMath0696.90045MaRDI QIDQ3995706
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
Convergence property of the Iri-Imai algorithm for some smooth convex programming problems ⋮ On controlling the parameter in the logarithmic barrier term for convex programming problems ⋮ Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems ⋮ An interior-point method for semi-infinite programming problems ⋮ The Newton modified barrier method for QP problems ⋮ Interior-point methods for nonlinear complementarity problems ⋮ A path following algorithm for a class of convex programming problems ⋮ A cutting plane algorithm for convex programming that uses analytic centers ⋮ A long-step barrier method for convex quadratic programming ⋮ Interior-point methods for convex programming ⋮ Logarithmic Barrier Decomposition Methods for Semi-infinite Programming ⋮ Solving the discrete \(l_p\)-approximation problem by a method of centers ⋮ On the choice of parameters for power-series interior point algorithms in linear programming ⋮ Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem ⋮ Improving complexity of structured convex optimization problems using self-concordant barriers ⋮ On the classical logarithmic barrier function method for a class of smooth convex programming problems ⋮ Interior-point algorithm for quadratically constrained entropy minimization problems
This page was built for publication:
