Discovery Projects - Grant ID: DP160101537

Funding Activity

Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the .

Funded Activity Summary

Relaxed reflection methods for feasibility and matrix completion problems. The project proposes to further develop the non-linear convergence theory, and to provide problem-specific implementations. Many applied and pure problems require solution of a large set of linear or nonlinear equations (or inequalities). Highly effective, parallelisable methods are based on iterated projection or reflection algorithms which aggregate information about individual equations. The theory is well developed in the linear case, but does not explain many important applications for which they are often highly successful (eg optical aberration correction, protein reconstruction, tomography, compressed sensing). The project also plans to provide heuristics to help explain why an algorithm performs well on one class of applications but fails on another.

Funded Activity Details

Start Date: 21-03-2016

End Date: 31-12-2021

Funding Scheme: Discovery Projects

Funding Amount: $564,979.00

Funder: Australian Research Council