2016
DOI: 10.1016/j.cam.2016.01.018
|View full text |Cite
|
Sign up to set email alerts
|

A convex optimization model for finding non-negative polynomials

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2017
2017
2018
2018

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 16 publications
0
4
0
Order By: Relevance
“…We have also developed some useful properties for low rank solutions to systems of linear matrix equations. This suggests us a reformulation of the IIR and FIR low-pass filter problems described in [17] as optimization problems over rank-one positive semidefinite matrices. In the future we will deal with this method to solve such filter design problem.…”
Section: Conclusion and Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…We have also developed some useful properties for low rank solutions to systems of linear matrix equations. This suggests us a reformulation of the IIR and FIR low-pass filter problems described in [17] as optimization problems over rank-one positive semidefinite matrices. In the future we will deal with this method to solve such filter design problem.…”
Section: Conclusion and Discussionmentioning
confidence: 99%
“…In the future we will deal with this method to solve such filter design problem. This might be suitable because the resulting positive semidefinite matrices derived by SDP solvers in [17] are usually full rank. Obviously, this requires a much more amount of memory and complexity in comparison with rank-one setting.…”
Section: Conclusion and Discussionmentioning
confidence: 99%
“…From this order, the necessary coefficients can be determined through provided design equations or from tables of available coefficients, which are further used in the implementation and realization of the necessary circuits. Additionally, optimization methods have also been explored to design these types of circuits [22,23].…”
Section: Coefficient Determinationmentioning
confidence: 99%
“…Recently, as a post-LMI framework, sum of squares (SOSs) decomposition [9,10] is a promising technique which provides a new direction to tackle the mentioned drawbacks. The SOS-based approaches facilitate a systematic procedure of designing a controller with a less conservative and low complex manner through semi-definite programming.…”
Section: Introductionmentioning
confidence: 99%