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

DOI10.1007/S11786-007-0021-7zbMATH Open1134.94314OpenAlexW2007261261MaRDI QIDQ2468356FDOQ2468356

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

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

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.

zbMATH Keywords

MIMO systemsparametric polynomial systemstochastic gradient algorithmdiscriminant varietyblind signal separationglobal convergence analysis

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Symbolic computation and algebraic computation (68W30) 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)

Cited In (2)

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

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)