scientific article; zbMATH DE number 4141790

zbMATH Open0696.90040MaRDI QIDQ3474482FDOQ3474482

Authors: Yuri Nesterov 

Publication date: 1989

Title of this publication is not available (Why is that?)

Recommendations

• Publication:3484632
• The solution of linear algebraic systems by polynomial iterative methods
• A polynomial algorithm for the quadratic programming problem
• scientific article; zbMATH DE number 4062814
• Quadrature-based polynomial optimization
• A polynomial algorithm for convex quadratic optimization subject to linear inequalities
• A polynomial Newton method for linear programming
• scientific article; zbMATH DE number 3543799
• Polynomial optimization, sums of squares, and applications
• scientific article; zbMATH DE number 617915

zbMATH Keywords

polynomial complexity

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Analysis of algorithms and problem complexity (68Q25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cited In (5)

• A comparison of methods for terminating polynomial iterations
• A proof of the polynomiality of the Iri-Imai method
• Iteration-complexity of first-order penalty methods for convex programming
• Smooth loops, generalized coherent states, and geometric phases
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474482)