Whitney's theorem, triangular sets, and probabilistic descent on manifolds
From MaRDI portal
Publication:2322361
DOI10.1007/s10957-019-01508-9OpenAlexW2964229907WikidataQ128205931 ScholiaQ128205931MaRDI QIDQ2322361
Publication date: 4 September 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.08548
Derivative-free methods and methods using generalized derivatives (90C56) Numerical optimization and variational techniques (65K10)
Cites Work
- Algorithms for computing triangular decomposition of polynomial systems
- The computation of simplicial approximations of implicitly defined \(p\)-dimensional manifolds
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- Numerical continuation methods: a perspective
- Piecewise linear methods for nonlinear equations and optimization
- On the theories of triangular sets
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
- An Algorithm for Piecewise-Linear Approximation of an Implicitly Defined Manifold
- Ideals, Varieties, and Algorithms
- Computing with semi-algebraic sets represented by triangular decomposition
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Direct Search Based on Probabilistic Descent
- Triangular decomposition of semi-algebraic systems
