RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive

Diskretn. Anal. Issled. Oper., 2021 Volume 28, Issue 3, Pages 65–89 (Mi da1282)

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

N. N. Tyunin

Omsk Branch of Sobolev Institute of Mathematics, 13 Pevtsov Street, 644043 Omsk, Russia

Abstract: The problem of short wave phased antenna arrays optimization was formulated as a quadratic programming problem. A penalty functions method and gradient ascent algorithm were applied to analyze a structure of a local optima set. The results of the proposed algorithm were compared with the results of the well-known BARON solver. Tab. 2, illustr. 3, bibliogr. 32.

Keywords: quadratic programming, local optimum, antenna array, gradient optimization, computational experiment.

UDC: 519.8

Received: 15.06.2020
Revised: 07.03.2021
Accepted: 09.03.2021

DOI: 10.33048/daio.2021.28.694



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025