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 1 of 1 for “"Fixed-point proximity algorithm"”.

  1. Inexact Fixed-Point Proximity Algorithms for Nonsmooth Convex Optimization

    … dissertation is to develop efficient inexact fixed-point proximity algorithms with convergence guaranteed for nonsmooth convex optimization problems encountered in data science. Nonsmooth convex optimization is one of the core methodologies in data science to acquire knowledge from real-world …

    odu Repository record for Inexact Fixed-Point Proximity Algorithms for Nonsmooth Convex Optimization (opens in a new tab)