Condition number based complexity estimate for computing local extrema
type: Item
instance of: scholarly article
title: Condition number based complexity estimate for computing local extrema
zbMATH Open document ID: 1187.68723
author: Zhikun She
author: Zhiming Zheng
published in: Journal of Computational and Applied Mathematics
publication date: 2009-06-25T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 5570571
zbMATH Keywords: steepest descent method
zbMATH Keywords: Sturm's theorem
zbMATH Keywords: grid subdivision
zbMATH Keywords: condition number
zbMATH Keywords: singly exponential
MaRDI profile type: Publication
full work available at URL: j.cam.2008.11.003
OpenAlex ID: W2026316151
cites work: Q4418650
cites work: On the complexity of exclusion algorithms for optimization
cites work: On some interior-point algorithms for nonconvex quadratic optimization
cites work: Q5807665
cites work: Q4079605
cites work: Solving systems of polynomial inequalities in subexponential time
cites work: A complete algorithm for counting real solutions of polynomial systems of equations and inequalities.
cites work: Q4372496
cites work: Complexity estimates depending on condition and round-off error
cites work: Q4720691
DOI: 10.1016/J.CAM.2008.11.003
Recommended article: Q4798085
Recommended article: Complexity aspects of local minima and related notions
Recommended article: On the deterministic complexity of searching local maxima
Recommended article: Q3484654
Recommended article: The complexity of the computation of the global extremum in a class of multi-extremum problems
Recommended article: Condition number based complexity estimate for solving polynomial systems
Recommended article: Computational bounds for local search in combinatorial optimization
Recommended article: Q4512210
Recommended article: Q3362580
Recommended article: On complexity of search of a function extremum
description: scientific article; zbMATH DE number 5570571