A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Convex optimization under inequality constraints in rank-deficient systems
Abstract Many geodetic applications require the minimization of a convex objective function subject to some linear equality and/or inequality constraints. If a system is singular (e.g., a geodetic network without a defined datum) this results in a manifold of solutions. Most state-of-the-art algorithms for inequality constrained optimization (e.g., the Active-Set-Method or primal-dual Interior-Point-Methods) are either not able to deal with a rank-deficient objective function or yield only one of an infinite number of particular solutions. In this contribution, we develop a framework for the rigorous computation of a general solution of a rank-deficient problem with inequality constraints. We aim for the computation of a unique particular solution which fulfills predefined optimality criteria as well as for an adequate representation of the homogeneous solution including the constraints. Our theoretical findings are applied in a case study to determine optimal repetition numbers for a geodetic network to demonstrate the potential of the proposed framework.
Convex optimization under inequality constraints in rank-deficient systems
Abstract Many geodetic applications require the minimization of a convex objective function subject to some linear equality and/or inequality constraints. If a system is singular (e.g., a geodetic network without a defined datum) this results in a manifold of solutions. Most state-of-the-art algorithms for inequality constrained optimization (e.g., the Active-Set-Method or primal-dual Interior-Point-Methods) are either not able to deal with a rank-deficient objective function or yield only one of an infinite number of particular solutions. In this contribution, we develop a framework for the rigorous computation of a general solution of a rank-deficient problem with inequality constraints. We aim for the computation of a unique particular solution which fulfills predefined optimality criteria as well as for an adequate representation of the homogeneous solution including the constraints. Our theoretical findings are applied in a case study to determine optimal repetition numbers for a geodetic network to demonstrate the potential of the proposed framework.
Convex optimization under inequality constraints in rank-deficient systems
Roese-Koerner, Lutz (author) / Schuh, Wolf-Dieter (author)
Journal of Geodesy ; 88
2014
Article (Journal)
English
BKL:
38.73
Geodäsie
Convex optimization under inequality constraints in rank-deficient systems
| Online Contents | 2014
A new iterative algorithm for a rank-deficient adjustment model with inequality constraints
| Online Contents | 2019
A new iterative algorithm for a rank-deficient adjustment model with inequality constraints
| Online Contents | 2019
Elimination of inequality constraints in convex optimization and application to yield design
| British Library Online Contents | 2001