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

  1. Local and Global Convergence for Convex-Composite Optimization

    Convex-composite optimization seeks to minimize f(x):=h(c(x)) over x in R^n, where h is closed, proper, and convex, and c is smooth. Such problems include nonlinear programming, mini-max optimization, estimation of nonlinear dynamics with non-Gaussian noise as well as many modern approaches to …

    washington Repository record for Local and Global Convergence for Convex-Composite Optimization (opens in a new tab)

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

    … complexity bounds, 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 …

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

  3. Saddle point techniques in convex composite and error-in-measurement optimization

    … and stability properties for large-scale optimization and optimization under uncertainty, and to bridge some of the gaps between modern optimization theories and recent applications emerging in the Big Data environment. To this end, the dissertation is dedicated to two important subjects …

    gatech Repository record for Saddle point techniques in convex composite and error-in-measurement optimization (opens in a new tab)

  4. Accelerated first-order optimization methods using inertia and error bounds

    Optimization is an important discipline of applied mathematics with far-reaching applications. Optimization algorithms often form the backbone of practical systems in machine learning, image processing, signal processing, computer vision, data analysis, and statistics. In an age of massive data …

    uiuc Repository record for Accelerated first-order optimization methods using inertia and error bounds (opens in a new tab)

  5. New insights into conjugate duality

    … - Lagrange dual problems to a given primal optimization problem can be obtained via perturbations and we present some connections between them. For the Fenchel - Lagrange dual problem we prove strong duality under more general conditions than known so far, while for the Fenchel duality we …

    qucosa-diss

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