Back to search

Georgia Institute of Technology

Faster Conditional Gradient Algorithms for Machine Learning

Abstract

dc:description.abstract

In this thesis, we focus on Frank-Wolfe (a.k.a. Conditional Gradient) algorithms, a family of iterative algorithms for convex optimization, that work under the assumption that projections onto the feasible region are prohibitive, but linear optimization problems can be efficiently solved over the feasible region. We present several algorithms that either locally or globally improve upon existing convergence guarantees. In Chapters 2-4 we focus on the case where the objective function is smooth and strongly convex and the feasible region is a polytope, and in Chapter 5 we focus on the case where the function is generalized self-concordant and the feasible region is a compact convex set.

Degree

thesis:*
Level thesis:degree_level
Doctoral
Department dc:contributor.department
Industrial and Systems Engineering
Grantor dc:publisher
Georgia Institute of Technology
Year dc:date.issued
2021

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Carderera De Diego, Alejandro Agustin
Advisor dc:contributor.advisor
  • Pokutta, Sebastian
Committee members dc:contributor.committeemember
  • Gupta, Swati
  • Lan, Guanghui
  • d'Aspremont, Alexandre
  • Diakonikolas, Jelena

Subjects

dc:subject × 3

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1853/66117

Chain of custody

source
Harvested from
Georgia Tech
Base URL
repository.gatech.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Carderera De Diego, Alejandro Agustin. Faster Conditional Gradient Algorithms for Machine Learning. Doctoral thesis, Georgia Institute of Technology, 2021. http://hdl.handle.net/1853/66117