The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
On gradients of functions definable in o-minimal structures
Open accessAbstract
We prove the o-minimal generalization of the Łojasiewicz inequality ∥ grad f ∥ ≥ | f | α , with α < 1 , in a neighborhood of a , where f is real analytic at a and f ( a ) = 0 . We deduce, as in the analytic case, that trajectories of the gradient of a function definable in an o-minimal structure are of uniformly bounded length. We obtain also that the gradient flow gives a retraction onto levels of such functions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Asymptotics for a Class of Non-Linear Evolution Equations, with Applications to Geometric Problems
Simon, L. (1983) · The Annals of Mathematics · doi:10.2307/2006981 · Cited by 729
Semianalytic and subanalytic sets
Bierstone, E., & Milman, P. D. (1988) · Publications Mathématiques de l'IHÉS · doi:10.1007/bf02699126 · Cited by 671
Geometric categories and o-minimal structures
van den Dries, L., & Miller, C. (1996) · Duke Mathematical Journal · doi:10.1215/s0012-7094-96-08416-1 · Cited by 573
Łojasiewicz, S. (1965) · Medical Entomology and Zoology · Cited by 520
Geometry of Subanalytic and Semialgebraic Sets
Shiota, M. (1997) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-2008-4 · Cited by 200
Cited by
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Bolte, J., Sabach, S., & Teboulle, M. (2014) · Mathematical Programming · doi:10.1007/s10107-013-0701-9 · Cited by 1,688
Attouch, H., Bolte, J., & Svaiter, B. F. (2013) · Mathematical Programming · doi:10.1007/s10107-011-0484-9 · Cited by 1,414
Attouch, H., Bolte, J., Redont, P., & Soubeyran, A. (2010) · Mathematics of Operations Research · doi:10.1287/moor.1100.0449 · Cited by 1,172
Xu, Y., & Yin, W. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/120887795 · Cited by 1,160
Bolte, J., Daniilidis, A., & Lewis, A. (2007) · SIAM Journal on Optimization · doi:10.1137/050644641 · Cited by 671
iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
Ochs, P., Chen, Y., Brox, T., & Pock, T. (2014) · SIAM Journal on Imaging Sciences · doi:10.1137/130942954 · Cited by 453
Modern regularization methods for inverse problems
Benning, M., & Burger, M. (2018) · Acta Numerica · doi:10.1017/s0962492918000016 · Cited by 412
Convergence of the Iterates of Descent Methods for Analytic Cost Functions
Absil, P. A., Mahony, R., & Andrews, B. (2005) · SIAM Journal on Optimization · doi:10.1137/040605266 · Cited by 291
A Globally Convergent Algorithm for Nonconvex Optimization Based on Block Coordinate Update
Xu, Y., & Yin, W. (2017) · Journal of Scientific Computing · doi:10.1007/s10915-017-0376-0 · Cited by 285
From error bounds to the complexity of first-order descent methods for convex functions
Bolte, J., Nguyen, T. P., Peypouquet, J., & Suter, B. W. (2017) · Mathematical Programming · doi:10.1007/s10107-016-1091-6 · Cited by 265
Metadata
- Authors
- Kurdyka, K.
- Venue
- Annales de l'Institut Fourier
- Publisher
- MathDoc/Centre Mersenne
- Published
- 1998
- Volume
- 48
- Issue
- 3
- Pages
- 769-783
- ISSN
- 0373-0956 (ISSN-L)
- 1777-5310
- OpenAlex
- W2022541060
- Cited by
- 461
- References
- 5
- FWCI
- 0.59
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.