Linearly constrained bilevel optimization: A smoothed implicit gradient approach
This work develops analysis and algorithms for solving a class of bilevel optimization
problems where the lower-level (LL) problems have linear constraints. Most of the existing …
problems where the lower-level (LL) problems have linear constraints. Most of the existing …
Rate-improved inexact augmented Lagrangian method for constrained nonconvex optimization
First-order methods have been studied for nonlinear constrained optimization within the
framework of the augmented Lagrangian method (ALM) or penalty method. We propose an …
framework of the augmented Lagrangian method (ALM) or penalty method. We propose an …
Efficiently esca** saddle points in bilevel optimization
A Newton-CG based barrier method for finding a second-order stationary point of nonconvex conic optimization with complexity guarantees
In this paper we consider finding an approximate second-order stationary point (SOSP) of
nonconvex conic optimization that minimizes a twice differentiable function over the …
nonconvex conic optimization that minimizes a twice differentiable function over the …