Results 31 to 40 of about 435,592 (297)
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
The P_0-matrix completion problem
The Electronic Journal of Linear Algebra, 2002 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
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
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
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
Nonlinear Traffic Prediction as a Matrix Completion Problem with Ensemble Learning [PDF]
Transportation Science, 2020 This paper addresses the problem of short-term traffic prediction for signalized traffic operations management. Specifically, we focus on predicting sensor states in high-resolution (second-by-second).
Wenqing Li, Chuhan Yang, S. Jabari
semanticscholar +1 more source
Kubik, 2021 Linear programming is a way to solve the problemof allocating limiter resources optimally. One of the methods used in solving the simplex method for mixed constraints is the two-phase method.
Elfira Safitri +3 more
doaj +1 more source
Wide and Deep Model of Multi-Source Information-Aware Recommender System
IEEE Access, 2018 Collaborative filtering recommendation suffers from the problems of high data sparsity, poor expansibility, cold start, and the difficulty of modeling user preferences, among which data sparsity is the greatest issue. Although our previous work on matrix
Weihua Yuan +4 more
doaj +1 more source