A globally convergent algorithm is presented for the solution of a wide class of semi-infinite programming problems. The method is based on the solution of a sequence of equality constrained quadratic programming problems, and usually has a second order convergence rate. Numerical results illustrating the effectiveness of the method are given.
Problems in signal processing and medical imaging often lead to calculating sparse solutions to under-determined linear systems. Methodologies for solving this problem are presented as background to the method used in this work where the problem is reformulated as an unconstrained convex optimization problem. The least squares approach is modified by an l… (More)
In many applications involving image reconstruction, signal observation time is limited. This emphasizes the requirement for optimal observation selection algorithms. A selection criterion using the trace of a matrix forms the basis of two existing algorithms, the Sequential Backward Selection and Sequential Forward Selection algorithms. Neither is optimal… (More)