scientific article; zbMATH DE number 3508265

From MaRDI portal

Revision as of 06:14, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4088614

Jump to:navigation, search

zbMath0324.90077MaRDI QIDQ4088614

D. B. Yudin, Arkadi Nemirovski

Publication date: 1976

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

zbMATH Keywords

upper and lower bounds informational complexity convex programming problem smooth programming problem

Mathematics Subject Classification ID

Convex programming (90C25) Information theory (general) (94A15)

Related Items (4)

A simple polynomial-time rescaling algorithm for solving linear programs ⋮ Convergence of a cyclic ellipsoid algorithm for systems of linear equalities ⋮ Modifications and implementation of the ellipsoid algorithm for linear programming ⋮ A deep cut ellipsoid algorithm for convex programming: Theory and applications

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4088614&oldid=17846246"