Results 11 to 20 of about 44,174 (262)
The Q0-matrix completion problem [PDF]
A matrix is a Q0-matrix if for every k∈{1,2,…,n}, the sum of all k×k principal minors is nonnegative. In this paper, we study some necessary and sufficient conditions for a digraph to have Q0-completion. Later on we discuss the relationship between Q and Q0-matrix completion problem. Finally, a classification of the digraphs of order up to four is done
openaire +2 more sources
Binary Matrix Completion With Nonconvex Regularizers
Many practical problems involve the recovery of a binary matrix from partial information, so the binary matrix completion (BMC) technique has increasingly been of interest in machine learning. In particular, we consider a special case of the BMC problems,
Chunsheng Liu, Hong Shan
doaj +1 more source
Image Completion with Hybrid Interpolation in Tensor Representation
The issue of image completion has been developed considerably over the last two decades, and many computational strategies have been proposed to fill-in missing regions in an incomplete image. When the incomplete image contains many small-sized irregular
Rafał Zdunek, Tomasz Sadowski
doaj +1 more source
Transportation problem is one of the problems that can be solved by using linear programming. Transportation method allow businessmen to minimize distribution costs, increase profits, and also fulfill the consumer needs at the same times.
MIKHA LAYASISA TARIGAN +2 more
doaj +1 more source
The P_0-matrix completion problem
A partial matrix is a rectangular array in which some entries are specified while others are free to be chosen. A completion of a partial matrix is a specific choice of values for the unspecified entries. A pattern for \(n \times n\) matrices is a list of positions of the matrix. An \(n \times n\) matrix is called a \(P_0\)-matrix (respectively, a \(P\)
Choi, Ji Young +4 more
openaire +4 more sources
Matrix Tri-Factorization Over the Tropical Semiring
Tropical semiring has proven successful in several research areas, including optimal control, bioinformatics, discrete event systems, and decision problems. Previous studies have applied a matrix two-factorization algorithm based on the tropical semiring
Amra Omanovic, Polona Oblak, Tomaz Curk
doaj +1 more source
Robust low‐rank Hankel matrix recovery for skywave radar slow‐time samples
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
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
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
A Dual-System Reinforcement Learning Method for Flexible Job Shop Dynamic Scheduling
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

