A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
An Aggregate Constraint Method for Inequality-constrained Least Squares Problems
Abstract The inequality-constrained least squares (ICLS) problem can be solved by the simplex algorithm of quadratic programming. The ICLS problem may also be reformulated as a Bayesian problem and solved by using the Bayesian principle. This paper proposes using the aggregate constraint method of non-linear programming to solve the ICLS problem by converting many inequality constraints into one equality constraint, which is a basic augmented Lagrangean algorithm for deriving the solution to equality-constrained non-linear programming problems. Since the new approach finds the active constraints, we can derive the approximate algorithm-dependent statistical properties of the solution. As a result, some conclusions about the superiority of the estimator can be approximately made. Two simulated examples are given to show how to compute the approximate statistical properties and to show that the reasonable inequality constraints can improve the results of geodetic network with an ill-conditioned normal matrix.
An Aggregate Constraint Method for Inequality-constrained Least Squares Problems
Abstract The inequality-constrained least squares (ICLS) problem can be solved by the simplex algorithm of quadratic programming. The ICLS problem may also be reformulated as a Bayesian problem and solved by using the Bayesian principle. This paper proposes using the aggregate constraint method of non-linear programming to solve the ICLS problem by converting many inequality constraints into one equality constraint, which is a basic augmented Lagrangean algorithm for deriving the solution to equality-constrained non-linear programming problems. Since the new approach finds the active constraints, we can derive the approximate algorithm-dependent statistical properties of the solution. As a result, some conclusions about the superiority of the estimator can be approximately made. Two simulated examples are given to show how to compute the approximate statistical properties and to show that the reasonable inequality constraints can improve the results of geodetic network with an ill-conditioned normal matrix.
An Aggregate Constraint Method for Inequality-constrained Least Squares Problems
Peng, Junhuan (author) / Zhang, Hongping (author) / Shong, Suli (author) / Guo, Chunxi (author)
Journal of Geodesy ; 79
2006
Article (Journal)
Electronic Resource
English
Recursive least squares with linear inequality constraints
| Online Contents | 2014
Efficiency in aggregate mix design: a ‘least squares’ method
| Elsevier | 1988
Recursive least squares with linear inequality constraints
| Springer Verlag | 2014
On non-combinatorial weighted total least squares with inequality constraints
| Online Contents | 2014
On non-combinatorial weighted total least squares with inequality constraints
| Online Contents | 2014