Variational learning algorithms for quantum query complexity
New Journal of PhysicsQuantum query complexity is pivotal in the analysis of quantum algorithms, encompassing well-known examples like search and period-finding algorithms. These algorithms typically involve a sequence of unitary operations and oracle calls dependent on an ...
Zipeng Wu +4 more
doaj +1 more source
Computable performance guarantees for compressed sensing matrices
EURASIP Journal on Advances in Signal Processing, 2018 The null space condition for ℓ 1 minimization in compressed sensing is a necessary and sufficient condition on the sensing matrices under which a sparse signal can be uniquely recovered from the observation data via ℓ 1 minimization.
Myung Cho, Kumar Vijay Mishra, Weiyu Xu
doaj +1 more source
Decomposition-Based Method for Sparse Semidefinite Relaxations of Polynomial Optimization Problems [PDF]
We consider polynomial optimization problems pervaded by a sparsity pattern. It has been shown in [1, 2] that the optimal solution of a polynomial programming problem with structured sparsity can be computed by solving a series of semidefinite ...
Berc Rustem +2 more
core
Data dissemination scheduling algorithm for V2R/V2V in multi-channel VANET
Tongxin xuebao, 2019 Considering that the data dissemination in multi-channel VANET (vehicular ad hoc network),a cooperative data dissemination scheduling algorithm was introduced for V2R(vehicle to roadside unit) and V2V(vehicle to vehicle).The algorithm created initial ...
Xin PENG +5 more
doaj +2 more sources
GloptiPoly 3: moments, optimization and semidefinite programming
, 2007 We describe a major update of our Matlab freeware GloptiPoly for parsing generalized problems of moments and solving them numerically with semidefinite ...
Henrion, Didier +2 more
core +2 more sources
Joint transceiver beamforming in MIMO cognitive radio network
Tongxin xuebao, 2015 An iterative SDP-MMSE algorithm based on semidefinite programs (SDP) and minimum mean squared error (MMSE) was introduced to minimize the total transmit power. And a further approach on the max-min fairness beam-forming was presented.
Yan GUO +3 more
doaj +2 more sources
Solving SDP's in Non-commutative Algebras Part I: The Dual-Scaling Algorithm [PDF]
Semidefinite programming (SDP) may be viewed as an extension of linear programming (LP), and most interior point methods (IPM s) for LP can be extended to solve SDP problems.However, it is far more difficult to exploit data structures (especially ...
Klerk, E. de, Pasechnik, D.V.
core +1 more source
Joint beamforming for multiuser SCFDE block transmission system in frequency selective MIMO channels
Tongxin xuebao, 2013 Single carrier frequency domain equalization (SCFDE) joint beamforming in frequency selective multiple input multiple output (MIMO) channels under the multi-user scenario was analyzed.Firstly,the frequency domain beamforming was transformed to a time ...
Li-zhou Xu +3 more
doaj +2 more sources
A Fast and Reliable Solution to PnP, Using Polynomial Homogeneity and a Theorem of Hilbert. [PDF]
Sensors (Basel), 2023 Keren D, Osadchy M, Shahar A.
europepmc +1 more source
Smoothed analysis of the low-rank approach for smooth semidefinite programs
, 2018 We consider semidefinite programs (SDPs) of size n with equality constraints. In order to overcome scalability issues, Burer and Monteiro proposed a factorized approach based on optimizing over a matrix Y of size $n$ by $k$ such that $X = YY^*$ is the ...
Boumal, Nicolas +2 more
core