Georgia Institute of Technology College of Sciences

In this talk, I will present a damped proximal augmented Lagrangian method (DPALM) for solving problems with a weakly-convex objective and convex linear/nonlinear constraints. Instead of taking a full stepsize, DPALM adopts a damped dual stepsize. DPALM can produce a (near) eps-KKT point within eps^{-2} outer iterations if each DPALM subproblem is solved to a proper accuracy. In addition, I will show overall iteration complexity of DPALM when the objective is either a regularized smooth function or in a regularized compositional form. For the former case, DPALM achieves the complexity of eps^{-2.5} to produce an eps-KKT point by applying an accelerated proximal gradient (APG) method to each DPALM subproblem. For the latter case, the complexity of DPALM is eps^{-3} to produce a near eps-KKT point by using an APG to solve a Moreau-envelope smoothed version of each subproblem. Our outer iteration complexity and the overall complexity either generalize existing best ones from unconstrained or linear-constrained problems to convex-constrained ones, or improve over the best-known results on solving the same-structured problems. Furthermore, numerical experiments on linearly/quadratically constrained non-convex quadratic programs and linear-constrained robust nonlinear least squares are conducted to demonstrate the empirical efficiency of the proposed DPALM over several state-of-the art methods.

The uniformization theorem states that every Riemann surface is a quotient of some subset of the complex projective line by a group of Mobius transformations. However, a number of closely related questions regarding the structure of uniformization maps remain open. For example, it is unclear how one might associate a uniformizing map to a given Riemann surface. In this talk we will discuss an approach to this question due to Gunning by attaching a projective line bundle to a Riemann surface and studying its analytic properties.

 Nordhaus and Gaddum proved in 1956 that the sum of the chromatic number  of a graph G and its complement is at most |G|+1.  The Nordhaus-Gaddum graphs are the class of graphs satisfying this inequality with equality, and are well-understood. In this paper we consider a hereditary generalization: graphs G for which all induced subgraphs H of G satisfy that the sum of the chromatic numbers of H and its complement are at least |H|. We characterize the forbidden induced subgraphs of this class and find its intersection with a number of common classes, including line graphs. We also discuss chi-boundedness and algorithmic results.

In 1992 Hitchin discovered distinguished components of the PSL(d,R) character variety for closed surface groups pi_1S and asked for an interpretation of those components in terms of geometric structures. Soon after, Choi-Goldman identified the SL(3,R)-Hitchin component with the space of convex projective structures on S. In 2008, Guichard-Wienhard identified the PSL(4,R)-Hitchin component with foliated projective structures on the unit tangent bundle T^1S. The case d \ge 5 remains open, and compels one to move beyond projective geometry to flag geometry. In joint work with Alex Nolte, we obtain a new description of the SL(3,R)-Hitchin component in terms of concave foliated flag structures on T^1S.