A Framework for Optimal Correction of Inconsistent Linear Constraints

Connections between the total least squares and the correction of an infeasible system of linear inequalities

Objectives To solve the problem that the coefficient matrix and the observation vector have structured characteristics for many practical applications in the field of surveying and mapping, that is, the coefficient matrix and the observation vector contain fixed quantities (or even fixed columns) and random quantities, and the random quantities at different positions are linearly related. Methods Starting from the errors-in-variables (EIV) function model, the augmented matrix composed of the coefficient matrix and the observation vector is expressed as an affine function form, and the function model is reconstructed by the variable projection method. Then, a structured total least squares (STLS) estimation algorithm is derived by the Lagrange method. Results The example results show that the proposed algorithm is consistent with the existing weighted or structured total least squares estimation algorithms that can solve structured problem in the coefficient matrix and the observation vector. Compared with the weighted total least squares (WTLS) estimation algorithms, the proposed algorithm only needs to establish a positive definite weight matrix of independent random variables and reduces the number of estimates. Compared with other STLS estimation algorithms, the proposed algorithm takes into account the overall structure of the coefficient matrix and the observation vector. Conclusions This shows the effectiveness of the proposed algorithm. The STLS estimation and the WTLS estimation ensure the statistical optimality from the perspective of the function model and the stochastic model, respectively.

In the image reconstruction of the electrical capacitance tomography (ECT) system, the application of the total least squares theory transforms the ill-posed problem into a nonlinear unconstrained minimization problem, which avoids calculating the matrix inversion. But in the iterative process of the coefficient matrix, the ill-posed problem is also produced. For the effect on the final image reconstruction accuracy of this problem, combined with the principle of the ECT system, the coefficient matrix is targeted and updated in the overall least squares iteration process. The new coefficient matrix is calculated, and then, the regularization matrix is corrected according to the adaptive targeting singular value, which can reduce the ill-posed effect. In this study, the total least squares iterative method is improved by introducing the mathematical model of EIV to deal with the errors in the measured capacitance data and coefficient matrix. The effect of noise interference on the measurement capacitance data is reduced, and finally, the high-quality reconstructed images are calculated iteratively.

Fast deconvolution with approximated PSF by RSTLS with antireflective boundary conditions

On the basis of the stream function field computed using a diagnostic model in the South China Sea in the summer 1998, the acoustic ray travel time tomography algorithm for reconstruction of two-dimensional flow field was tested by the numerical simulation in the region east to Vietnam. Error or noise contaminates the coefficients of both transfer matrix and measure data of the inverse equation of ocean acoustic tomography (OAT). Previous work on ill-posed problem in OAT commonly used Tikhonov regularization technology considering error only in observation data. Here, the truncated total least squares method (TTLS), which simultaneously considers error and noise on both sides, is applied for inverse solutions and its performances is compared with conventional Tikhonov method. The investigation suggests that the truncated total least squares method can substantially improve reconstruction of stream function field and is a promising alternative method for the solution of ocean acoustic tomography inverse problem.

Simulating (elastically) deformable models that can collide with each other and with the environment remains a challenging task. The resulting contact problems can be elegantly approached using Lagrange multipliers to represent the unknown magnitude of the response forces. Typical methods construct and solve a Linear Complementarity Problem (LCP) to obtain the response forces. This requires the inverse of the generalized mass matrix, which is generally hard to obtain for deformable-body problems. In this article, we tackle such contact problems by directly solving the Mixed Linear Complementarity Problem (MLCP) and omitting the construction of an LCP matrix. Since a convex quadratic program with linear constraints is equivalent to an MLCP, we propose to use a Conjugate Residual (CR) solver as the backbone of our collision response system. By dynamically updating the set of active constraints, the MLCP with inequality constraints can be solved efficiently. We also propose a simple yet efficient preconditioner that ensures faster convergence. Finally, our approach is faster than existing methods (at the same accuracy), and it allows accurate treatment of friction.

Linear inverse problems with uncertain measurement matrices appear in many different applications. One of the standard techniques for solving such problems is the total least squares (TLS) method. Recently, an alternative approach has been suggested, based on maximizing an appropriate likelihood function assuming that the measurement matrix consists of random Gaussian variables. We refer to this technique as the total maximum likelihood (TML) method. Here we extend this strategy to the case in which the measurement matrix is structured so that the perturbations are not arbitrary but rather follow a fixed pattern. The resulting estimate is referred to as the structured TML (STML). As we show, the STML can be viewed as a regularized version of the structured TLS (STLS) approach in which the regularization consists of a logarithmic penalty. In contrast to the STLS solution, the STML always exists. Furthermore, its performance in practice tends to be superior to that of the STLS and competitive to other regularized solvers, as we illustrate via several examples. We also consider a few interesting special cases in which the STML can be computed efficiently either by reducing it into a one-dimensional problem regardless of the problem size or by a decomposition via a discrete Fourier transform.

This paper deals with developing four efficient algorithms (including the conjugate gradient least-squares, least-squares with QR factorization, least-squares minimal residual and Paige algorithms) to numerically find the (least-squares) solutions of the following (in-) consistent quaternion matrix equation $$\begin{aligned} {A_1}X + {\left( {{A_1}X} \right) ^{\eta H}} + {B_1}YB_1^{\eta H} + {C_1}ZC_1^{\eta H} = {D_1}, \end{aligned}$$ in which the coefficient matrices are large and sparse. More precisely, we construct four efficient iterative algorithms for determining triple least-squares solutions (X, Y, Z) such that X may have a special assumed structure, Y and Z can be either $$\eta $$ -Hermitian or $$\eta $$ -anti-Hermitian matrices. In order to speed up the convergence of the offered algorithms for the case that the coefficient matrices are possibly ill-conditioned, a preconditioned technique is employed. Some numerical test problems are examined to illustrate the effectiveness and feasibility of presented algorithms.

Linear reachability problems and minimal solutions to linear Diophantine equation systems

A variable transformation method for solving linear absolute-value objective-function problems with linear constraints

In the classical geodetic data processing, a non- linear problem always can be converted to a linear least squares adjustment. However, the errors in Jacob matrix are often not being considered when using the least square method to estimate the optimal parameters from a system of equations. Furthermore, the identity weight matrix may not suitable for each element in Jacob matrix. The weighted total least squares method has been frequently applied in geodetic data processing for the case that the observation vector and the coefficient matrix are perturbed by random errors, which are zero mean and statistically in- dependent with inequality variance. In this contribution, we suggested an approach that employ the weighted total least squares to solve the nonlinear problems and to mitigate the affection of noise in Jacob matrix. The weight matrix of the vector from Jacob matrix is derived by the law of nonlinear error propagation. Two numerical examples, one is the triangulation adjustment and another is a simulation experiment, are given at last to validate the feasibility of the developed method.

Many planning problems involve choosing a set of optimal decisions for a system in the face of uncertainty of elements that may play a central role in the way the system is analyzed and operated. During the past decade, there has been a renewed interest in the modelling, analysis, and solution of such problems due to a remarkable development of both new theoretical results and novel computational techniques in stochastic optimization. A prominent approach is to develop upper and lower bounding approximations to the problem along with procedures to sharpen bounds until an acceptable tolerance is satisfied. The contributions of this dissertation are concerned with the latter approach. The thesis first studies the stochastic linear programming problem with randomness in both the objective coefficients and the constraints. A convex concave saddle property of the value function is utilized to derive new bounding techniques which generalize previously known results. These approximations require discretizing bounded domains of the random variables in such a way that tight upper and lower bounds result. Such techniques will prove attractive with the recent advances in large scale linear programming. The above results are also extended to obtain new upper and lower bounds when the domains of random variables are unbounded. While these bounds are tight, the approximating models are large-scale deterministic linear programs. In particular, with a proposed order-cone decomposition for the domains, these linear programs are well-structured, thus enabling one to use efficient techniques for solution, such as parallel computation. The thesis next considers convex stochastic programs. Using aggregation concepts from the deterministic literature, new bounds are developed for the problem which are computable using standard convex programming algorithms. Finally, the discussion is focused on a stochastic convex program arising in a certain resource allocation problem. Exploiting the problem structure, bounds are developed via the Karush-Kuhn-Tucker conditions. Rather than discretizing domains, these approximations advocate replacing difficult multidimensional integrals by a series of simple univariate integrals. Such practice allows one to preserve differentiability properties so that smooth convex programming methods can be applied for solution.

For the expected value formulation of stochastic linear complementarity problem, we establish modulus-based matrix splitting iteration methods. The convergence of the new methods is discussed when the coefficient matrix is a positive definite matrix or a positive semi-definite matrix, respectively. The advantages of the new methods are that they can solve the large scale stochastic linear complementarity problem, and spend less computational time. Numerical results show that the new methods are efficient and suitable for solving the large scale problems.

In this paper, we introduce total dual integrality of the linear complementarity problem (LCP) by analogy with the linear programming problem. The main idea of defining the notion is to propose the LCP with orientation, a variant of the LCP whose feasible complementary cones are specified by an additional input vector. Then we naturally define the dual problem of the LCP with orientation and total dual integrality of the LCP. We show that if the LCP is totally dual integral, then all basic solutions are integral. If the input matrix is sufficient or rank-symmetric, and the LCP is totally dual integral, then our result implies that the LCP always has an integral solution whenever it has a solution. We also introduce a class of matrices such that any LCP instance having the matrix as a coefficient matrix is totally dual integral. We investigate relationships between matrix classes in the LCP literature such as principally unimodular matrices. Principally unimodular matrices are known that all basic solutions to the LCP are integral for any integral input vector. In addition, we show that it is coNP-hard to decide whether a given LCP instance is totally dual integral.

Robust model-reference control for descriptor linear systems with structural parameter uncertainties is investigated. A sufficient condition for existing a model-reference zero-error asymptotic tracking controller is given. It is shown that the robust model reference control problem can be decomposed into two subproblems: a robust state feedback stabilization problem for descriptor systems subject to parameter uncertainties and a robust compensation problem. The latter aims to find three coefficient matrices which satisfy four matrix equations and simultaneously minimize the effect of the uncertainties to the tracking error. Based on a complete parametric solution to a class of generalized Sylvester matrix equations, the robust compensation problem is converted into a minimization problem with quadratic cost and linear constraints. A numerical example shows the effect of the proposed approach.