Sciweavers

158 search results - page 6 / 32
» Solving Box-Constrained Integer Least Squares Problems
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Recovery of sparse perturbations in Least Squares problems
We show that the exact recovery of sparse perturbations on the coefficient matrix in overdetermined Least Squares problems is possible for a large class of perturbation structure...
Mert Pilanci, Orhan Arikan
MOR
2002
94views more  MOR 2002»
13 years 7 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
CSDA
2007
96views more  CSDA 2007»
13 years 7 months ago
On a quadratic eigenproblem occurring in regularized total least squares
In a recent paper Sima, Van Huffel and Golub [Regularized total least squares based on quadratic eigenvalue problem solvers. BIT Numerical Mathematics 44, 793 - 812 (2004)] sugges...
J. Lampe, H. Voss
CDC
2008
IEEE
133views Control Systems» more  CDC 2008»
13 years 7 months ago
A nonlinear least squares estimation procedure without initial parameter guesses
Abstract-- This paper introduces a convex formulation approach for the initialization of parameter estimation problems (PEP). The proposed method exploits the parameter-affine feat...
Julian Bonilla Alarcon, Moritz Diehl, Bart De Moor...
SIAMNUM
2011
252views more  SIAMNUM 2011»
13 years 2 months ago
Analysis and Computation of Compatible Least-Squares Methods for div-curl Equations
We develop and analyze least-squares finite element methods for two complementary div-curl elliptic boundary value problems. The first one prescribes the tangential component of ...
Pavel B. Bochev, Kara Peterson, Christopher M. Sie...