Results 91 to 100 of about 836,294 (206)
Array pattern synthesis using semidefinite programming and a bisection method
ETRI Journal, 2019 In this paper, we propose an array pattern synthesis scheme using semidefinite programming (SDP) under array excitation power constraints. When an array pattern synthesis problem is formulated as an SDP problem, it is known that an additional rank‐one ...
Jong‐Ho Lee +3 more
doaj +1 more source
International Journal of Robust and Nonlinear Control, Volume 36, Issue 14, Page 6856-6876, 25 September 2026.ABSTRACT Designing safe control laws for nonlinear systems is challenging, especially when ensuring stability under actuator saturation and state constraints. A key aspect is embedding controllers with a Region of Attraction (ROA), which defines initial conditions guaranteeing convergence to a stable equilibrium point (EP).
Bhaskar Biswas +3 more
wiley +1 more source
Exploiting Sparsity in SDP Relaxation for Harmonic Balance Method
IEEE Access, 2020 In general, harmonic balance problems are extremely nonconvex and difficult to solve. A convex relaxation in the form of semidefinite programming has attracted a lot of attention recently, as it finds a global solution with high accuracy without the need
Cheng-Hsiung Yang, Ben Shen Deng
doaj +1 more source
International Journal of Electrical Power & Energy SystemsWith the accelerating integration of distributed energy resources (DERs) into grids, enhanced bidirectional interactions between distribution and transmission systems have significantly complicated grid coordination.
Zhe Chen +5 more
doaj +1 more source
Quantum Alternating Direction Method of Multipliers for Semidefinite Programming [PDF]
QuantumSemidefinite programming (SDP) is a fundamental convex optimization problem with wide-ranging applications. However, solving large-scale instances remains computationally challenging due to the high cost of solving linear systems and performing ...
Hantao Nie, Dong An, Zaiwen Wen
doaj +1 more source
A Relaxed Interior Point Method for Low-Rank Semidefinite Programming Problems with Applications to Matrix Completion. [PDF]
J Sci Comput, 2021 Bellavia S, Gondzio J, Porcelli M.
europepmc +1 more source
Generalized Gauss Inequalities via Semidefinite Programming
A sharp upper bound on the probability of a random vector falling outside a polytope, based solely on the first and second moments of its distribution, can be computed efficiently using semidefinite programming.
Goulart, Paul J. +2 more
core +1 more source
Bounds for codes by semidefinite programming [PDF]
Proceedings of the Steklov Institute of Mathematics, 2008 Delsarte's method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that using as variables power sums of distances this problem can be considered as a finite semidefinite programming ...
openaire +3 more sources
Semidefinite Programming for Approximate Maximum Likelihood Sinusoidal Parameter Estimation
EURASIP Journal on Advances in Signal Processing, 2009 We study the convex optimization approach for parameter estimation of several sinusoidal models, namely, single complex/real tone, multiple complex sinusoids, and single two-dimensional complex tone, in the presence of additive Gaussian noise.
Kenneth W. K. Lui, H. C. So
doaj +1 more source
A Reduced Semidefinite Programming Formulation for HA Assignment Problems in Sport Scheduling
Trends in Computational and Applied Mathematics, 2018 Home-Away Assignment problems are naturally cast as quadraticpro gramming models in binary variables. In this work we compare alternative formulations for this kind of problems.
Hugo José Lara +2 more
doaj +1 more source