( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials.

. Math. Program., 32 (3): 301-318 (1985)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Michael James

Audrein James

Katherine James

Ammini James-Mammoottil

Rojin James

 

Другие публикации лиц с тем же именем

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)A polynomial-time algorithm, based on Newton's method, for linear programming.. Math. Program., 40 (1-3): 59-93 (1988)Incorporating Condition Measures into the Complexity Theory of Linear Programming.. SIAM J. Optimization, 5 (3): 506-524 (1995)Recent Progress on the Complexity of the Decision Problem for the Reals.. Discrete and Computational Geometry, том 6 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 287-308. DIMACS/AMS, (1990)A Faster PSPACE Algorithm for Deciding the Existential Theory of the Reals. FOCS, стр. 291-295. IEEE Computer Society, (1988)Linear programming, complexity theory and elementary functional analysis.. Math. Program., (1995)Computing approximate solutions for convex conic systems of constraints., и . Math. Program., 87 (3): 351-383 (2000)