Mathematical programming techniques to solve biharmonic problems by a recursive projection algorithm

To solve a classical ill-conditioned problem in the sense of Hadamard as the initial Cauchy problem for a biharmonic operator after some a priori estimates, a posteriori estimates are evaluated using three different methods of minimization such as: linear programming, least squares and a recursive projection algorithm for least squares. Numerical comparisons will be made on these three methods.