# Interior Point Polynomial Algorithms in Convex Programming

Credited to: Arkadi Nemirovski

Canonical: https://www.synapsebooks.app/catalog/interior-point-polynomial-algorithms-in-convex-programming

Status: Discovery record. No guide is published.

## Focus

Supplied bibliography entry.

## The Library, Volume IV

Listed title: Interior Point Polynomial Algorithms in Convex Programming

Listed credit: Arkadi Nemirovski

Publication details: Not supplied

Source shelf: 13. Computational Science

Source line: 1461

Group: None

Difficulty: 3

No supplied note

Catalog metadata from the supplied bibliography. Edition and access verification pending.

## Find the original

Edition verification pending. [Search Open Library](https://openlibrary.org/search?title=Interior+Point+Polynomial+Algorithms+in+Convex+Programming&author=Arkadi+Nemirovski)

This discovery record is not a book summary. Named editorial approval of guide text remains pending.
