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 4 of 4 for “"inexact proximal point method"”.

  1. Um método proximal inexato com distâncias proximais para problemas de equilíbrio Quase-monótono

    In this work we propose an inexact proximal point method to solve quasimonotone equilibrium problems using proximal distances and the diagonal subdifferential. Under some natural assumptions on the problem and the quasimonotonicity condition on the bifunction, we prove that the sequence generated …

    brazil-uerj Repository record for Um método proximal inexato com distâncias proximais para problemas de equilíbrio Quase-monótono (opens in a new tab)

  2. Design and Analysis of Algorithms for Composite Optimization

    In this thesis, we study first-order methods (FOMs) for solving three types of composite optimization problems: convex nonsmooth, convex hybrid, and nonconcex smooth. We revisit three representative methods among FOMs: proximal point, proximal bundle, and accelerated composite gradient (ACG). We …

    gatech Repository record for Design and Analysis of Algorithms for Composite Optimization (opens in a new tab)

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

    … on developing and analyzing accelerated and inexact first-order methods for 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 …

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

  4. On Computation and Application of Optimal Transport

    … cases. For the discrete cases, I develop an Inexact Proximal point method for exact Optimal Transport problem (IPOT) with the proximal operator approximately evaluated at each iteration using projections to the probability simplex. The algorithm (a) converges to exact Wasserstein distance …

    gatech Repository record for On Computation and Application of Optimal Transport (opens in a new tab)