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 3 of 3 for “"Function constrained optimization"”.

  1. Convex and structured nonconvex optimization for modern machine learning: Complexity and algorithms

    In this thesis, we investigate various optimization problems motivated by applications in modern-day machine learning. In the first part, we look at the computational complexity of training ReLU neural networks. We consider the following problem: given a fully-connected two hidden layer ReLU neural …

    gatech Repository record for Convex and structured nonconvex optimization for modern machine learning: Complexity and algorithms (opens in a new tab)

  2. Exploiting Problem Structure for Faster Optimization: A Trilinear Saddle Point Approach

    Optimization is vital in operations research, encompassing model fitting and decision-making. The exponential growth of data holds promise for realistic models and intelligent decision-making. However, the sheer volume and the exceptional dimension of big data make computations prohibitively …

    gatech Repository record for Exploiting Problem Structure for Faster Optimization: A Trilinear Saddle Point Approach (opens in a new tab)

  3. Theory and applications of first-order methods for convex optimization with function constraints

    … development of efficient first-order methods for function constrained convex optimization and their applications in a few different areas, including healthcare, finance and machine learning. The thesis consists of three major studies. The first part of the thesis considers the problem of …

    gatech Repository record for Theory and applications of first-order methods for convex optimization with function constraints (opens in a new tab)