Condition number based complexity estimate for computing local extrema
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1884459
- Complexity aspects of local minima and related notions
- On the deterministic complexity of searching local maxima
- scientific article; zbMATH DE number 4156224
- The complexity of the computation of the global extremum in a class of multi-extremum problems
- Condition number based complexity estimate for solving polynomial systems
- Computational bounds for local search in combinatorial optimization
- scientific article; zbMATH DE number 1524330
- On the complexity of the search of an extremum of a function
- On complexity of search of a function extremum
Cites work
- A complete algorithm for counting real solutions of polynomial systems of equations and inequalities.
- Complexity estimates depending on condition and round-off error
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 1096865 (Why is no real title available?)
- scientific article; zbMATH DE number 1962814 (Why is no real title available?)
- scientific article; zbMATH DE number 3992817 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- On some interior-point algorithms for nonconvex quadratic optimization
- On the complexity of exclusion algorithms for optimization
- Solving systems of polynomial inequalities in subexponential time
Cited in
(3)
This page was built for publication: Condition number based complexity estimate for computing local extrema
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1026449)