Condition number based complexity estimate for computing local extrema

DOI10.1016/j.cam.2008.11.003zbMath1187.68723OpenAlexW2026316151MaRDI QIDQ1026449

Zhikun She, Zhi Ming Zheng

Publication date: 25 June 2009

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2008.11.003

zbMATH Keywords

condition numberSturm's theoremsteepest descent methodgrid subdivisionsingly exponential

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30)

Related Items (2)

Condition number based complexity estimate for solving polynomial systems ⋮ Discovering polynomial Lyapunov functions for continuous dynamical systems

Cites Work

• On the complexity of exclusion algorithms for optimization
• Solving systems of polynomial inequalities in subexponential time
• On some interior-point algorithms for nonconvex quadratic optimization
• A complete algorithm for counting real solutions of polynomial systems of equations and inequalities.
• Complexity estimates depending on condition and round-off error
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Condition number based complexity estimate for computing local extrema