Results 61 to 70 of about 1,650,745 (287)
On the rank minimization problem [PDF]
Proceedings of the 2004 American Control Conference, 2004 After a brief overview of the problem of finding the extremal (minimum or maximum) rank positive semidefinite matrix subject to matrix inequalities, we identify a few new classes of such problems that can be efficiently solved. We then proceed to present an algorithm for solving the general class of rank minimization problems.
null Yoonsoo Kim, M. Mesbahi
openaire +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Objective To compare the efficacy and safety of roxarestat versus recombinant human erythropoietin (rhEPO) in the management of renal anemia in patients undergoing maintenance hemodialysis. Methods This was a prospective, open‐label, randomized controlled trial.
Lingling Chen, Junjie Zhu, Qiaonan Ge
wiley +1 more source
Mixed Alternating Projections with Application to Hankel Low-Rank Approximation
Algorithms, 2022 The method of alternating projections for extracting low-rank signals is considered. The problem of decreasing the computational costs while keeping the estimation accuracy is analyzed.
Nikita Zvonarev, Nina Golyandina
doaj +1 more source
Organoids in pediatric cancer research
FEBS Letters, EarlyView.Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley +1 more source
Array pattern synthesis using semidefinite programming and a bisection method
ETRI Journal, 2019 In this paper, we propose an array pattern synthesis scheme using semidefinite programming (SDP) under array excitation power constraints. When an array pattern synthesis problem is formulated as an SDP problem, it is known that an additional rank‐one ...
Jong‐Ho Lee +3 more
doaj +1 more source
HOSVD-Based Algorithm for Weighted Tensor Completion
Journal of Imaging, 2021 Matrix completion, the problem of completing missing entries in a data matrix with low-dimensional structure (such as rank), has seen many fruitful approaches and analyses.
Zehan Chao +2 more
doaj +1 more source
When Does an Ensemble of Matrices with Randomly Scaled Rows Lose Rank?
, 2015 We consider the problem of determining rank loss conditions for a concatenation of full-rank matrices, such that each row of the composing matrices is scaled by a random coefficient.
Avestimehr, A. Salman +2 more
core +1 more source
Cell wall target fragment discovery using a low‐cost, minimal fragment library
FEBS Letters, EarlyView.LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan +5 more
wiley +1 more source
ON RANK REVERSAL OF ALTERNATIVE PROBLEM WHILE MULTICRITERIA ESTIMATING
Міжнародний науково-технічний журнал "Проблеми керування та інформатики", 2006 The phenomenon of alternatives rank reversal is studied, appearing in rating calculation using Analytic Hierarchy Process (AHP) method. The sufficient condition is found for the rank reversal absence.
V.G. Totsenko
doaj
IEEE Access, 2019 Compressed hyperspectral image reconstruction plays an important role in hyperspectral image processing, which aims to reduce the cost of transmission and recover the hyperspectral image from a small amount of data.
Zongrui Wu +4 more
doaj +1 more source