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 “"Proximal Quasi-Newton Methods"”.

  1. Proximal Methods for Nonconvex Composite Optimization Problems

    … function. In this thesis several numerical methods for solving such problems in finite-dimensional spaces are discussed, which are based on proximity operators. After some basic results from convex and nonsmooth analysis are summarized, a first-order method, the proximal gradient method, is …

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

  2. Nonconvex and Nonsmooth Inverse Problems

    … particular, we develop a family of splitting methods that first relaxes key parts of the inverse problem, and then solves an augmented problem with improved numerical properties and easier analyzation. Our key application is seismic inversion, with more additional applications to data …

    washington Repository record for Nonconvex and Nonsmooth Inverse Problems (opens in a new tab)

  3. On the Relationship between Conjugate Gradient and Optimal First-Order Methods for Convex Optimization

    … namely the traditional conjugate gradient methods and optimal first-order techniques. We derive conditions under which conjugate gradient methods attain the same complexity bound as in Nemirovsky-Yudin's and Nesterov's methods. Moreover, we propose a conjugate gradient-type algorithm named …

    waterloo Repository record for On the Relationship between Conjugate Gradient and Optimal First-Order Methods for Convex Optimization (opens in a new tab)