- Home
- Publications
- Publication Search
- Publication Details
Title
Computing critical points for invariant algebraic systems
Authors
Keywords
-
Journal
JOURNAL OF SYMBOLIC COMPUTATION
Volume -, Issue -, Pages -
Publisher
Elsevier BV
Online
2022-10-24
DOI
10.1016/j.jsc.2022.10.002
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Homotopy techniques for solving sparse column support determinantal polynomial systems
- (2021) George Labahn et al. JOURNAL OF COMPLEXITY
- Symmetric ideals, Specht polynomials and solutions to symmetric systems of equations
- (2021) Philippe Moustrou et al. JOURNAL OF SYMBOLIC COMPUTATION
- Solving determinantal systems using homotopy techniques
- (2020) Jon D. Hauenstein et al. JOURNAL OF SYMBOLIC COMPUTATION
- Bit complexity for multi-homogeneous polynomial system solving—Application to polynomial minimization
- (2018) Mohab Safey El Din et al. JOURNAL OF SYMBOLIC COMPUTATION
- Invariant algebraic sets and symmetrization of polynomial systems
- (2018) Evelyne Hubert JOURNAL OF SYMBOLIC COMPUTATION
- A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
- (2017) Mohab Safey El Din et al. JOURNAL OF THE ACM
- Symmetric semi-algebraic sets and non-negativity of symmetric polynomials
- (2016) Cordian Riener JOURNAL OF PURE AND APPLIED ALGEBRA
- Resultant of an equivariant polynomial system with respect to the symmetric group
- (2016) Laurent Busé et al. JOURNAL OF SYMBOLIC COMPUTATION
- Computation of invariants of finite abelian groups
- (2016) Evelyne Hubert et al. MATHEMATICS OF COMPUTATION
- A Probabilistic Symbolic Algorithm to Find the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set
- (2014) Gabriela Jeronimo et al. DISCRETE & COMPUTATIONAL GEOMETRY
- Elimination for Generic Sparse Polynomial Systems
- (2014) María Isabel Herrero et al. DISCRETE & COMPUTATIONAL GEOMETRY
- A Baby Step–Giant Step Roadmap Algorithm for General Algebraic Sets
- (2014) S. Basu et al. FOUNDATIONS OF COMPUTATIONAL MATHEMATICS
- Intrinsic complexity estimates in polynomial optimization
- (2014) Bernd Bank et al. JOURNAL OF COMPLEXITY
- On the Complexity of Computing Critical Points with Gröbner Bases
- (2014) Pierre-Jean Spaenlehauer SIAM JOURNAL ON OPTIMIZATION
- Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
- (2014) Aurélien Greuet et al. SIAM JOURNAL ON OPTIMIZATION
- Gröbner bases of symmetric ideals
- (2013) Stefan Steidel JOURNAL OF SYMBOLIC COMPUTATION
- Numerically Computing Real Points on Algebraic Sets
- (2012) Jonathan D. Hauenstein ACTA APPLICANDAE MATHEMATICAE
- Affine solution sets of sparse polynomial systems
- (2012) María Isabel Herrero et al. JOURNAL OF SYMBOLIC COMPUTATION
- On the complexity of computing with zero-dimensional triangular sets
- (2012) Adrien Poteaux et al. JOURNAL OF SYMBOLIC COMPUTATION
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- (2012) Cordian Riener et al. MATHEMATICS OF OPERATIONS RESEARCH
- Cell decomposition of almost smooth real algebraic surfaces
- (2012) Gian Mario Besana et al. NUMERICAL ALGORITHMS
- On the degree and half-degree principle for symmetric polynomials
- (2011) Cordian Riener JOURNAL OF PURE AND APPLIED ALGEBRA
- On the geometry of polar varieties
- (2010) Bernd Bank et al. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING
- Computing isolated roots of sparse polynomial systems in affine space
- (2010) María Isabel Herrero et al. THEORETICAL COMPUTER SCIENCE
- Algebraic Degree of Polynomial Optimization
- (2009) Jiawang Nie et al. SIAM JOURNAL ON OPTIMIZATION
- Deformation Techniques for Sparse Systems
- (2008) Gabriela Jeronimo et al. FOUNDATIONS OF COMPUTATIONAL MATHEMATICS
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started