scientific article; zbMATH DE number 3385445

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Items (15)

An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming ⋮ Convergence and computational analyses for some variable target value and subgradient deflection methods ⋮ Optimization of computations ⋮ On N. Z. Shor's three scientific ideas ⋮ Unified representation of the classical ellipsoid method ⋮ The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches ⋮ A ``build-down scheme for linear programming ⋮ Complexity analysis of a linear complementarity algorithm based on a Lyapunov function ⋮ A simple polynomial-time rescaling algorithm for solving linear programs ⋮ Convergence of a generalized subgradient method for nondifferentiable convex optimization ⋮ Orthogonalizing linear operators in convex programming. I, II ⋮ Convergence of a cyclic ellipsoid algorithm for systems of linear equalities ⋮ Modifications and implementation of the ellipsoid algorithm for linear programming ⋮ Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday) ⋮ Variable metric relaxation methods, part II: The ellipsoid method

This page was built for publication: