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 2 of 2 for “"proximal gradient method"”.

  1. Efficient Numerical Algorithms for Structured Nonsmooth Min–Max and Adjustable Robust Optimization problems with Applications

    … and look at two such approaches: splitting methods tailored for nonconvex min-max problems and adjustable robust optimization models reformulated via conic programming reformulation. Splitting methods are a class of iterative algorithms well-suited to tackling these by exploiting the problem …

    unsw Repository record for Efficient Numerical Algorithms for Structured Nonsmooth Min–Max and Adjustable Robust Optimization problems with Applications (opens in a new tab)

  2. Time-varying networks estimation and Chinese words segmentation

    … develop a fast algorithm, based on the smoothing proximal gradient method, which is computationally efficient and accurate. We illustrate the proposed method through simulation studies and children's attention deficit hyperactivity disorder fMRI data, and show that the proposed method and …

    uiuc Repository record for Time-varying networks estimation and Chinese words segmentation (opens in a new tab)