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 2 of 2 for “"Conditional gradients"”.

  1. A reduction framework for approximate extended formulations and a faster algorithm for convex optimization

    … bounds motivates the lazification technique for conditional gradient type algorithms. This technique allows us to replace (approximate) linear optimization in favor of a much weaker subroutine, achieving significant performance improvement in practice. We can summarize the main contributions as …

    gatech Repository record for A reduction framework for approximate extended formulations and a faster algorithm for convex optimization (opens in a new tab)

  2. Bridging Discrete and Continuous Methods for Faster Optimization and Machine Learning

    … In Chapter 3, we focus on improving the rates of conditional gradient variants (in the presence of combinatorial structures) while maintaining their efficiency. We develop a novel theoretical framework that provides a unifying view of various descent directions in the literature and demystifies …

    gatech Repository record for Bridging Discrete and Continuous Methods for Faster Optimization and Machine Learning (opens in a new tab)