Autor der Publikation

Recent Progress on the Complexity of the Decision Problem for the Reals.

. Discrete and Computational Geometry, Volume 6 von DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Seite 287-308. DIMACS/AMS, (1990)

Bitte wählen Sie eine Person um die Publikation zuzuordnen

Um zwischen Personen mit demselben Namen zu unterscheiden, wird der akademische Grad und der Titel einer wichtigen Publikation angezeigt. Zudem lassen sich über den Button neben dem Namen einige der Person bereits zugeordnete Publikationen anzeigen.

 

Weitere Publikationen von Autoren mit dem selben Namen

On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials.. Math. Program., 32 (3): 301-318 (1985)Hyperbolic Programs, and Their Derivative Relaxations. Foundations of Computational Mathematics, 6 (1): 59-79 (2006)"Efficient" Subgradient Methods for General Convex Optimization.. SIAM J. Optimization, 26 (4): 2649-2676 (2016)Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method.. SIAM J. Optimization, 6 (4): 879-912 (1996)Incorporating Condition Measures into the Complexity Theory of Linear Programming.. SIAM J. Optimization, 5 (3): 506-524 (1995)A polynomial-time algorithm, based on Newton's method, for linear programming.. Math. Program., 40 (1-3): 59-93 (1988)Recent Progress on the Complexity of the Decision Problem for the Reals.. Discrete and Computational Geometry, Volume 6 von DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Seite 287-308. DIMACS/AMS, (1990)A Faster PSPACE Algorithm for Deciding the Existential Theory of the Reals. FOCS, Seite 291-295. IEEE Computer Society, (1988)Computing approximate solutions for convex conic systems of constraints., und . Math. Program., 87 (3): 351-383 (2000)Some perturbation theory for linear programming.. Math. Program., (1994)