scientific article; zbMATH DE number 3232960
From MaRDI portal
Publication:5520839
zbMath0144.30601MaRDI QIDQ5520839
Publication date: 1965
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
Subgradient methods for sharp weakly convex functions ⋮ Solving nonsmooth inclusions in the convex case ⋮ Block-iterative surrogate projection methods for convex feasibility problems ⋮ On finitely convergent iterative methods for the convex feasibility problem ⋮ A finitely convergent ``row-action method for the convex feasibility problem ⋮ On relaxation methods for systems of linear inequalities ⋮ Finite convergence of a subgradient projections method with expanding controls ⋮ An interior points algorithm for the convex feasibility problem ⋮ RSG: Beating Subgradient Method without Smoothness and Strong Convexity ⋮ Linear complementarity problems solvable by A single linear program ⋮ Optimization of lipschitz continuous functions ⋮ A superlinearly convergent projection algorithm for solving the convex inequality problem ⋮ A global quadratic algorithm for solving a system of mixed equalities and inequalities ⋮ Linear inequalities and some of their applications ⋮ New iterative methods for linear inequalities
This page was built for publication: