On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae
From MaRDI portal
Publication:4027865
DOI10.1137/0221060zbMath0768.65022OpenAlexW2158795180MaRDI QIDQ4027865
Publication date: 9 March 1993
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/8742
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to single equations (65H05) Complexity and performance of numerical algorithms (65Y20)
Related Items (8)
Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints ⋮ On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals ⋮ FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension ⋮ An Almost Optimal Algorithm for Computing Nonnegative Rank ⋮ Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity ⋮ Approximation schemes for \(r\)-weighted minimization knapsack problems ⋮ Complexity, exactness, and rationality in polynomial optimization ⋮ Computation of equilibria in noncooperative games
This page was built for publication: On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae
