The problems of non-convex quadratic programming related to phased antenna arrays optimization

2021 ◽  
Vol 28 (3) ◽  
pp. 65-89
Author(s):  
N. N. Tyunin
2020 ◽  
Author(s):  
Shefali Pawar ◽  
Hossein Mehrpour Bernety ◽  
Harry G. Skinner ◽  
Seong-Youp Suh ◽  
Andrea Alù ◽  
...  

2015 ◽  
Vol 07 (04) ◽  
pp. 1550050
Author(s):  
Carlos J. Luz

For any graph [Formula: see text] Luz and Schrijver [A convex quadratic characterization of the Lovász theta number, SIAM J. Discrete Math. 19(2) (2005) 382–387] introduced a characterization of the Lovász number [Formula: see text] based on convex quadratic programming. A similar characterization is now established for the weighted version of the number [Formula: see text] independently introduced by McEliece, Rodemich, and Rumsey [The Lovász bound and some generalizations, J. Combin. Inform. Syst. Sci. 3 (1978) 134–152] and Schrijver [A Comparison of the Delsarte and Lovász bounds, IEEE Trans. Inform. Theory 25(4) (1979) 425–429]. Also, a class of graphs for which the weighted version of [Formula: see text] coincides with the weighted stability number is characterized.


Sign in / Sign up

Export Citation Format

Share Document