Journal Article10.1137/080725787
Proximity of Weighted and Layered Least Squares Solutions
6
TL;DR: Vavasis and Ye proved that the limiting solution exists, and showed that the limit is characterized as the solution of a variant of the least squares problem called the layered least squares (LLS) problem.
read more
Abstract: In this paper, we analyze the limiting behavior of the weighted least squares (WLS) problem $\min_{x\in\Re^n}\sum_{i=1}^p\|D_i(A_ix-b_i)\|^2$, where each $D_i$ is a positive definite diagonal matrix. We consider the situation where the magnitude of the weights differs drastically from one block to the next so that $\max(D_1)\geq\min(D_1)\gg\max(D_2)\geq\min(D_2)\gg\max(D_3)\geq\cdots\gg\max(D_{p-1})\geq\min(D_{p-1})\gg\max(D_p)$. Here $\max(\cdot)$ and $\min(\cdot)$ represent the maximum and minimum entries of diagonal elements, respectively. Specifically, we consider the case when the gap $g\equiv\min_i1/(\|D_i^{-1}\|\|D_{i+1}\|)$ is very large or tends to infinity. Vavasis and Ye proved that the limiting solution exists (when the proportion of diagonal elements within each block $D_i$ is unchanged and only the gap $g$ tends to $\infty$), and showed that the limit is characterized as the solution of a variant of the least squares problem called the layered least squares (LLS) problem. We analyze the difference between the solutions of WLS and LLS quantitatively and show that the norm of the difference of the two solutions is bounded above by $O(\chi_A\bar{\chi}_A^{2(p+1)}g^{-2}\|b\|)$ and $O(\bar{\chi}_A^{2p+3}g^{-2}\|b\|)$ in the variable and the residual spaces, respectively, using the two condition numbers $\chi_A\equiv\max_{B\in{\cal B}}\|B^{-1}\|$ and $\bar{\chi}_A\equiv\max_{B\in{\cal B}}\|AB^{-1}\|$ of $A$, where ${\cal B}$ is the set of all nonsingular $n\times n$ submatrices of $A$, $A=[A_1;\ldots;A_p]$ and $b = [b_1;\ldots;b_p]$. A remarkable feature of this result is that the error bound is represented in terms of $A$, $g$ (and $b$) and independent of the weights $D_i$, $i=1,\ldots,p$. The analysis is carried out by making the change of variables to convert the matrix $A$ into a basis lower-triangular form and then by applying the Sherman-Morrison-Woodbury formula.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Efficient resolution of potentially conflicting linear constraints in robotics
Dimitar Dimitrov,Alexander Sherikov,Pierre-Brice Wieber +2 more
- 05 Aug 2015
TL;DR: Numerical results are presented based on three representative examples adopted from recent robotics literature which demonstrate that complex hierarchical problems can be tackled in real-time even with limited computational resources.
24
A Simple Variant of the Mizuno--Todd--Ye Predictor-Corrector Algorithm and Its Objective-Function-Free Complexity
TL;DR: This paper proposes a simple variant of the Mizuno--Todd--Ye predictor-corrector algorithm for linear programming that employs a simple and a natural scaling-invariant search directio...
7
•Dissertation
Online generation of time- optimal trajectories for industrial robots in dynamic environments
Saed Al Homsi
- 17 Mar 2016
TL;DR: A reactive trajectory generation algorithm that reacts in real time, removes the fastidious optimization process which is traditionally executed by hand by handling it automatically, and provides a practical way of generating locally time optimal solutions.
•Posted Content
Multiplicative Perturbation Bounds for Multivariate Multiple Linear Regression in Schatten $p$-Norms
Jocelyn T. Chi,Ilse C. F. Ipsen +1 more
TL;DR: In this paper, a geometric interpretation of the action of the sketching matrix in terms of relevant subspaces is presented, where a key term in assessing the accuracy of the sketched MMLR solution can be viewed as a tangent of a largest principal angle between sub-spaces under some assumptions.
2
References
On the Complexity of Approximating Extremal Determinants in Matrices
TL;DR: It is NP-hard to determine whether a set of n rational points in d dimensions is affinely or linearly degenerate and an algorithm for approximating ?
106
Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
TL;DR: The global convergence property of the affine scaling method under the assumption of dual nondegeneracy is investigated and it is shown that the step-size 1/8, where the displacement vector is normalized with respect to the distance in the scaled space, is sufficient to guarantee the global convergence for dual nondEGenerate LP problems.
73
On bounds for scaled projections and pseudoinverses
TL;DR: In this article, it was shown that the bounds for the norms of these matrices are computable independent of the norm of the positive definite diagonal matrix of the matrix of full column rank.
52
On Linear Least-Squares Problems With Diagonally Dominant Weight Matrices
TL;DR: The solution of the unconstrained weighted linear least-squares problem is known to be a convex combination of the basic solutions formed by the nonsingular subsystems if the weight matrix is diagonal andpositive definite, which implies that the norm of this solution is uniformly bounded for any diagonal and positive definite weight matrix.
42
A Variant of the Vavasis-Ye Layered-Step Interior-Point Algorithm for Linear Programming
TL;DR: A variant of Vavasis and Ye's layered-step path-following primal-dual interior-point algorithm for linear programming which uses from time to time the layered least squares (LLS) direction in place of the affine scaling (AS) direction.
38