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 5 of 5 for “"Nonconvex composite optimization"”.

  1. Proximal Methods for Nonconvex Composite Optimization Problems

    Optimization problems with composite functions deal with the minimization of the sum of a smooth function and a convex nonsmooth function. In this thesis several numerical methods for solving such problems in finite-dimensional spaces are discussed, which are based on proximity operators. After …

    wurz-thes Repository record for Proximal Methods for Nonconvex Composite Optimization Problems (opens in a new tab)

  2. Accelerated Inexact First-Order Methods for Solving Nonconvex Composite Optimization Problems

    … solving or finding stationary points of various nonconvex composite optimization (NCO) problems. Our main tools mainly come from variational and convex analysis, and our key results are in the form of iteration complexity bounds and how these bounds compare to other ones in the literature. Our …

    gatech Repository record for Accelerated Inexact First-Order Methods for Solving Nonconvex Composite Optimization Problems (opens in a new tab)

  3. Fast First-Order Methods for Large-Scale Nonconvex Optimization and Semidefinite Programming

    … for solving unconstrained convex/strongly convex composite optimization problems, linearly-constrained nonconvex composite optimization problems, and semidefinite programs. We show through extensive computational experiments that the algorithms developed in this thesis are anywhere from 5 to 100 …

    gatech Repository record for Fast First-Order Methods for Large-Scale Nonconvex Optimization and Semidefinite Programming (opens in a new tab)

  4. First-Order Algorithms for Nonlinear Structured Optimization

    Nonlinear optimization is a critical branch in applied mathematics and has attracted wide attention due to its popularity in practical applications. In this work, we present two methods which use first-order information to solve two typical classes of nonlinear structured optimization problems. For …

    lsu-thes Repository record for First-Order Algorithms for Nonlinear Structured Optimization (opens in a new tab)

  5. 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)