A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
A new iterative algorithm for a rank-deficient adjustment model with inequality constraints
https://orcid.org/0000-0001-9371-3525
Abstract This paper is concerned with the rank-deficient problem of least squares adjustment models with inequality constraints. First, the problem under study is transformed into a linear complementarity problem (LCP) with a P0-matrix (P0-LCP), which is a non-symmetric matrix whose principal minors are all nonnegative. Second, both Mangasarian’s symmetric successive over relaxation and a perturbed LCP with arbitrarily small perturbation are employed to solve the P0-LCP. As a result, a new iterative algorithm for rank-deficient adjustment models with inequality constraints is presented, and its convergence is proven. Finally, examples are given to demonstrate the efficiency of the proposed algorithm. It is shown that the proposed algorithm can not only assess the stability of points but also provide additional adjustment criteria to guarantee the uniqueness of solutions to the problem of rank-deficient free-network adjustment.
A new iterative algorithm for a rank-deficient adjustment model with inequality constraints
https://orcid.org/0000-0001-9371-3525
Abstract This paper is concerned with the rank-deficient problem of least squares adjustment models with inequality constraints. First, the problem under study is transformed into a linear complementarity problem (LCP) with a P0-matrix (P0-LCP), which is a non-symmetric matrix whose principal minors are all nonnegative. Second, both Mangasarian’s symmetric successive over relaxation and a perturbed LCP with arbitrarily small perturbation are employed to solve the P0-LCP. As a result, a new iterative algorithm for rank-deficient adjustment models with inequality constraints is presented, and its convergence is proven. Finally, examples are given to demonstrate the efficiency of the proposed algorithm. It is shown that the proposed algorithm can not only assess the stability of points but also provide additional adjustment criteria to guarantee the uniqueness of solutions to the problem of rank-deficient free-network adjustment.
A new iterative algorithm for a rank-deficient adjustment model with inequality constraints
https://orcid.org/0000-0001-9371-3525
Abstract This paper is concerned with the rank-deficient problem of least squares adjustment models with inequality constraints. First, the problem under study is transformed into a linear complementarity problem (LCP) with a P0-matrix (P0-LCP), which is a non-symmetric matrix whose principal minors are all nonnegative. Second, both Mangasarian’s symmetric successive over relaxation and a perturbed LCP with arbitrarily small perturbation are employed to solve the P0-LCP. As a result, a new iterative algorithm for rank-deficient adjustment models with inequality constraints is presented, and its convergence is proven. Finally, examples are given to demonstrate the efficiency of the proposed algorithm. It is shown that the proposed algorithm can not only assess the stability of points but also provide additional adjustment criteria to guarantee the uniqueness of solutions to the problem of rank-deficient free-network adjustment.
A new iterative algorithm for a rank-deficient adjustment model with inequality constraints
Song, Yingchun (author)
Journal of Geodesy ; 93
2019
Article (Journal)
Electronic Resource
English
A new iterative algorithm for a rank-deficient adjustment model with inequality constraints
| Online Contents | 2019
Convex optimization under inequality constraints in rank-deficient systems
| Online Contents | 2014
Convex optimization under inequality constraints in rank-deficient systems
| Online Contents | 2014
A new ridge estimation method on rank-deficient adjustment model
| Online Contents | 2021
Iterative algorithm for weighted total least squares adjustment
| Online Contents | 2014