Semi-Definite Programming for Real Root Finding
-
- LUI Kenneth Wing Kin
- Department of Electronic Engineering, City University of Hong Kong
-
- SO Hing Cheung
- Department of Electronic Engineering, City University of Hong Kong
Search this article
Abstract
In this Letter, we explore semi-definite relaxation (SDR) program for finding the real roots of a real polynomial. By utilizing the square of the polynomial, the problem is approximated using the convex optimization framework and a real root is estimated from the corresponding minimum point. When there is only one real root, the proposed SDR method will give the exact solution. In case of multiple real roots, the resultant solution can be employed as an accurate initial guess for the iterative approach to get one of the real roots. Through factorization using the obtained root, the reminding real roots can then be solved in a sequential manner.
Journal
-
- IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
-
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E93-A (3), 636-639, 2010
The Institute of Electronics, Information and Communication Engineers
- Tweet
Details 詳細情報について
-
- CRID
- 1390282681288855552
-
- NII Article ID
- 10026863596
-
- NII Book ID
- AA10826239
-
- ISSN
- 17451337
- 09168508
-
- Text Lang
- en
-
- Data Source
-
- JaLC
- Crossref
- CiNii Articles
-
- Abstract License Flag
- Disallowed