Search Results - "fully polynomial approximation algorithm"
-
1
Authors:
Source: SIAM Journal on Optimization. 6:638-652
Subject Terms: Convex programming, separation oracle, convergence, fully polynomial approximation algorithm, potential reduction, convex feasibility problems, dual column generation algorithm, 0211 other engineering and technologies, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, complexity, Nonconvex programming, global optimization, cutting planes
File Description: application/xml
Access URL: https://epubs.siam.org/doi/abs/10.1137/S1052623493258635
https://dl.acm.org/doi/10.1137/S1052623493258635
https://doi.org/10.1137/S1052623493258635
https://dblp.uni-trier.de/db/journals/siamjo/siamjo6.html#GoffinLY96
https://experts.umn.edu/en/publications/complexity-analysis-of-an-interior-cutting-plane-method-for-conve
Full Text Finder
Nájsť tento článok vo Web of Science