Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"operation complexity"”.

  1. Novel first-order methods for bilevel and minimax optimization.

    … efficient augmented Lagrangian methods with complexity guarantees for both nonconvex-concave and nonconvex–strongly-concave objective functions. We then show that bilevel optimization can be approximately reformulated as a minimax problem and introduce first-order penalty methods with …

    umn Repository record for Novel first-order methods for bilevel and minimax optimization. (opens in a new tab)