If you made any changes in Pure these will be visible here soon.

Personal profile

Biography

James Saunderson is currently a lecturer in the Electrical and Computer Systems Engineering department at Monash University.

James received the Bachelor of Engineering and Bachelor of Science degrees (both with Honours) from the University of Melbourne in 2008. He then completed MS and PhD degrees in Electrical Engineering and Computer Science at Massachusetts Institute of Technology (MIT) in 2011 and 2015 respectively. Before joining Monash, he spent a year as a Postdoctoral scholar jointly in Electrical Engineering at Caltech and the University of Washington.

Monash teaching commitment

ECE4132 Control System Design, Semester 2, 2018, 2019

ECE2111 Signals and Systems, Semester 2, 2017, 2018, 2019

ECE3062 Electronics and Control (control part), Semester 2, 2016, 2017

 

Research interests

James' research is focused on mathematical optimisation, especially methods based on convex optimisation and semidefinite programming, and their application broadly in science and engineering. He is particularly interested in understanding algebraic structure in optimisation, and exploiting it to develop improved computational methods, with performance guarantees, for important classes of optimisation problems arising in practice.

Research area keywords

  • Convex Optimization
  • Semidefinite Programming
  • Signal Processing
  • Machine Learning
  • Mathematics
  • Applied Mathematics - Operations Research
  • Applied Mathematics
  • Computational Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2008 2019

3 Citations (Scopus)

Semidefinite approximations of the Matrix Logarithm

Fawzi, H., Saunderson, J. & Parrilo, P. A., 1 Apr 2019, In : Foundations of Computational Mathematics. 19, 2, p. 259-296 38 p.

Research output: Contribution to journalArticleResearchpeer-review

A spectrahedral representation of the first derivative relaxation of the positive semidefinite cone

Saunderson, J. F., 1 Oct 2018, In : Optimization Letters. 12, 7, p. 1475–1486 12 p.

Research output: Contribution to journalArticleResearchpeer-review

Competitive online algorithms for resource allocation over the positive semidefinite cone

Eghbali, R., Saunderson, J. & Fazel, M., 1 Jul 2018, In : Mathematical Programming. 170, 1, p. 267-292 26 p.

Research output: Contribution to journalArticleResearchpeer-review

2 Citations (Scopus)

Symmetric sums of squares over k-subset hypercubes

Raymond, A., Saunderson, J., Singh, M. & Thomas, R. R., 1 Feb 2018, In : Mathematical Programming. 167, 2, p. 315-354 40 p.

Research output: Contribution to journalArticleResearchpeer-review

Equivariant semidefinite lifts of regular polygons

Fawzi, H., Saunderson, J. & Parrilo, P. A., 1 May 2017, In : Mathematics of Operations Research. 42, 2, p. 472-494 23 p.

Research output: Contribution to journalArticleResearchpeer-review