Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Speaker: | Levent Tuncel |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics 3 (M3) 2134 |
In the theory of modern interior-point algorithms,
approaches that treat primal and the dual problems in a symmetric way
have led to some of the deepest theoretical results as well as some of the
most successful software in that area.
I will present some mathematical foundations for the design and
analysis of primal-dual symmetric algorithms for convex optimization
problems. These foundations make the generalization of such methods
from linear and semidefinite optimization settings to general convex optimization setting possible. I will conclude with a complexity analysis which applies to a wide range of primal-dual interior-point algorithms. Our bound on the number of iterations extends the current best iteration complexity bounds from the special cases of linear and semidefinite optimization to the general convex optimization setting.
This talk is based on joint work with Tor Myklebust.
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
The University of Waterloo acknowledges that much of our work takes place on the traditional territory of the Neutral, Anishinaabeg and Haudenosaunee peoples. Our main campus is situated on the Haldimand Tract, the land granted to the Six Nations that includes six miles on each side of the Grand River. Our active work toward reconciliation takes place across our campuses through research, learning, teaching, and community building, and is co-ordinated within the Office of Indigenous Relations.