scientific article

From MaRDI portal

Revision as of 08:01, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:3686495

Jump to:navigation, search

zbMath0568.90062MaRDI QIDQ3686495

P. F. Pickel

Publication date: 1985

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

zbMATH Keywords

survey computational complexity ellipsoid algorithm perfect graphs computational comparison Karmarkar's algorithm generalized reduced gradient augmented Lagrangian code

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Linear programming (90C05)

Related Items (2)

A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm ⋮ Implementing an affine scaling algorithm for linear programming

This page was built for publication:

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