Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
Huber's M-estimation technique is applied to a block-angular regression problem, which may arise from some applications. A recursive, modified Newton approach to computing th...
This work is concerned with the structure of bilinear minimization problems arising in recovering subsampled and modulated images in parallel magnetic resonance imaging. By consid...
—Virtual coordinate systems (VCS) provide accurate estimations of latency between arbitrary hosts on a network, while conducting a small amount of actual measurements and relying...