Results 21 to 30 of about 9,824 (145)

Robust Interior Point Method for Quantum Key Distribution Rate Computation [PDF]

open access: yesQuantum, 2022
Security proof methods for quantum key distribution, QKD, that are based on the numerical key rate calculation problem, are powerful in principle. However, the practicality of the methods are limited by computational resources and the efficiency and ...
Hao Hu   +4 more
doaj   +1 more source

Alternative SDP and SOCP approximations for polynomial optimization

open access: yesEURO Journal on Computational Optimization, 2019
In theory, hierarchies of semidefinite programming (SDP) relaxations based on sum of squares (SOS) polynomials have been shown to provide arbitrarily close approximations for a general polynomial optimization problem (POP).
Xiaolong Kuang   +3 more
doaj   +1 more source

Application of semidefinite programming to truss design optimization / Santvaros optimizavimo uždavinių sprendimas taikant pusiau apibrėžtą programavimą

open access: yesMokslas: Lietuvos Ateitis, 2015
Semidefinite Programming (SDP) is a fairly recent way of solving optimization problems which are becoming more and more important in our fast moving world. It is a minimization of linear function over the intersection of the cone of positive semidefinite
Rasa Giniūnaitė
doaj   +1 more source

Multipath Exploitation with Time Reversal Waveform Covariance Matrix for SNR Maximization

open access: yesRemote Sensing, 2020
Radar target detection has a wide range of applications in the military and civilian remote sensing fields; in particular, the target detection in multipath environments has attracted many scholars’ attention in recent years.
Chao Xiong, Chongyi Fan, Xiaotao Huang
doaj   +1 more source

The lq/lp Hankel norms of discrete-time positive systems across switching

open access: yesSICE Journal of Control, Measurement, and System Integration, 2022
In this study, we focus on the $ l_q/l_p $ Hankel norms of linear time-invariant (LTI) discrete-time positive systems across a single switching. The $ l_q/l_p $ Hankel norms are defined as the induced norms from vector-valued $ l_p $ past inputs to ...
Y. Ebihara
doaj   +1 more source

Orthonormal polynomial projection quantization: an algebraic eigenenergy bounding method

open access: yesActa Polytechnica, 2022
The ability to generate tight eigenenergy bounds for low dimension bosonic or ferminonic, hermitian or non-hermitian, Schrödinger operator problems is an important objective in the computation of quantum systems.
Carlos R. Handy
doaj   +1 more source

Discrete-Time Indefinite Stochastic LQ Control via SDP and LMI Methods

open access: yesJournal of Applied Mathematics, 2012
This paper studies a discrete-time stochastic LQ problem over an infinite time horizon with state-and control-dependent noises, whereas the weighting matrices in the cost function are allowed to be indefinite.
Shaowei Zhou, Weihai Zhang
doaj   +1 more source

Computing frequency response of non‐parametric uncertainty model of MIMO systems using υ‐gap metric optimization

open access: yesIET Control Theory & Applications, 2021
This paper presents the computation of the non‐parametric uncertainty model for multi input multi output (MIMO) systems, which is described by normalized coprime factors (NCF) using the frequency response data of the system.
Seyed Masoud Tabibian   +2 more
doaj   +1 more source

Bootstrap, Markov Chain Monte Carlo, and LP/SDP hierarchy for the lattice Ising model

open access: yesJournal of High Energy Physics, 2023
Bootstrap is an idea that imposing consistency conditions on a physical system may lead to rigorous and nontrivial statements about its physical observables. In this work, we discuss the bootstrap problem for the invariant measure of the stochastic Ising
Minjae Cho, Xin Sun
doaj   +1 more source

Tightness of the maximum likelihood semidefinite relaxation for angular synchronization [PDF]

open access: yes, 2014
Maximum likelihood estimation problems are, in general, intractable optimization problems. As a result, it is common to approximate the maximum likelihood estimator (MLE) using convex relaxations.
Bandeira, Afonso S.   +2 more
core   +2 more sources

Home - About - Disclaimer - Privacy