Results 31 to 40 of about 42,601 (304)
Robust low‐rank Hankel matrix recovery for skywave radar slow‐time samples
IET Radar, Sonar & Navigation, 2021 In skywave radar, the slow‐time samples received in a certain range‐azimuth cell are usually processed for signal analysis and target detection. Particularly, to extract the principal components, such as sea clutter and target signal, in slow‐time ...
Baiqiang Zhang, Junhao Xie, Wei Zhou
doaj +1 more source
A New Sparse Quasi-Newton Update Method
Sultan Qaboos University Journal for Science, 2012 Based on the idea of maximum determinant positive definite matrix completion, Yamashita proposed a sparse quasi-Newton update, called MCQN, for unconstrained optimization problems with sparse Hessian structures.
Minghou Cheng, Yu-Hong Dai, Rui Diao
doaj +1 more source
Hybrid time-quality-cost trade-off problems
Operations Research Perspectives, 2018 Agile and hybrid project management has become increasingly popular among practitioners, particularly in the IT sector. In contrast to the theoretically and algorithmically well-established and developed time-cost and time-quality-cost project management
Zsolt T. Kosztyán, István Szalkai
doaj +1 more source
Matrix Completion and Related Problems via Strong Duality [PDF]
, 2018 This work studies the strong duality of non-convex matrix factorization problems: we show that under certain dual conditions, these problems and its dual have the same optimum.
Liang, Yingyu +5 more
core +1 more source
A Dual-System Reinforcement Learning Method for Flexible Job Shop Dynamic Scheduling
Shanghai Jiaotong Daxue xuebao, 2022 In the production process of aerospace structural parts, there coexist batch production tasks and research and development (R&D) tasks. Personalized small-batch R&D and production tasks lead to frequent emergency insertion orders.
LIU Yahui, SHEN Xingwang, GU Xinghai, PENG Tao, BAO Jinsong, ZHANG Dan
doaj +1 more source
Some remarks on matrix pencil completion problems [PDF]
, 2004 summary:The matrix pencil completion problem introduced in [J. J. Loiseau, S. Mondié, I. Zaballa, and P. Zagalak: Assigning the Kronecker invariants to a matrix pencil by row or column completions. Linear Algebra Appl. 278 (1998)] is reconsidered and the
Mondié, Sabine +2 more
core +1 more source
Moving target detection method based on CUR‐RPCA for missing array elements
IET Radar, Sonar & Navigation, 2022 Moving target detection performance is seriously affected by missing array elements for multichannel synthetic aperture radar (Multi‐SAR) systems. Meanwhile, there is a contradiction between the accuracy of data recovery and the computational burden in ...
Jianli Shi +4 more
doaj +1 more source
Doubly constrained totally positive line insertion
Special Matrices, 2020 It is shown that in any TP matrix, a line (row or column) with two speci˝ed entries in any positions (and the others appropriately chosen) may be inserted in any position, as long as the two entries are consistent with total positivity.
Johnson Charles R., Allen David W.
doaj +1 more source
Efficient Data Gathering Methods in Wireless Sensor Networks Using GBTR Matrix Completion
Sensors, 2016 To obtain efficient data gathering methods for wireless sensor networks (WSNs), a novel graph based transform regularized (GBTR) matrix completion algorithm is proposed.
Donghao Wang +4 more
doaj +1 more source
The nonnegative Q−matrix completion problem
Journal of Algebra Combinatorics Discrete Structures and Applications, 2017 Summary: In this paper, the nonnegative \(Q\)-matrix completion problem is studied. A real \(n\times n\) matrix is a \(Q\)-matrix if for \(k\in \{1,\dots, n\}\), the sum of all \(k \times k\) principal minors is positive. A digraph \(D\) is said to have nonnegative \(Q\)-completion if every partial nonnegative \(Q\)-matrix specifying \(D\) can be ...
SARMA, Bhaba Kumar, SİNHA, Kalyan
openaire +4 more sources