Using computer algebra to certify the global convergence of a numerical optimization process

DOI10.1007/S11786-007-0021-7MaRDI QIDQ2468356zbMATH OpenOpenAlexFDO

Authors Nong Gu, D. Lazard, Fabrice Rouillier, Yong Xiang

Publication date 22 January 2008

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11786-007-0021-7

zbMATH Keywords

blind signal separationdiscriminant varietyglobal convergence analysisMIMO systemsparametric polynomial systemstochastic gradient algorithm

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Semialgebraic sets and related spaces (14P10) Numerical methods for mathematical programming, optimization and variational techniques (65K99) Symbolic computation and algebraic computation (68W30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Stochastic gradient adaptive algorithms for blind source separation
• Blind Separation of Positive Sources by Globally Convergent Gradient Search
• Separation of digital communication mixtures with the CMA: case of unknown symbol rates
• Convergence analysis of a randomly perturbed infomax algorithm for blind source separation
• Robust blind source separation algorithms using cumulants.

Cited in

(2)

• Thirty years of polynomial system solving, and now?
• On verified numerical computations in convex programming

Describes a project that uses

Uses Software

• MPFI
• QEPCAD
• ISOLATE

This page was built for publication: Using computer algebra to certify the global convergence of a numerical optimization process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2468356)