Now showing items 1-4 of 4

    • Integer optimization for the understanding and disruption of illicit networks 

      Kosmas, Daniel (Rensselaer Polytechnic Institute, Troy, NY, 2022-08)
      Tools from operations research (OR) have historically been applied to better understand and disrupt illicit trafficking networks. Two such tools are community detection and network interdiction. Community detection has ...
    • Low-order methods for nonconvex functional constrained optimization 

      Li, Zichong (Rensselaer Polytechnic Institute, Troy, NY, 2022-07)
      Recently, many real-world problems in engineering and data science not only have very large scales and complicated functional constraints, but also go beyond the scope of convex optimization and inevitably include nonconvex ...
    • Nonconvex regularizers for sparse optimization and rank minimization 

      Sagan, April (Rensselaer Polytechnic Institute, Troy, NY, 2021-05)
      This dissertation addresses the problem of minimizing a nonconvex relaxation to the rank of a matrix. In the first of three works presented in this dissertation, we present the problem of rank minimization as a semidefinite ...
    • The geometry of learning and the learning of geometry 

      Tatro, Norman Joseph (Rensselaer Polytechnic Institute, Troy, NY, 2021-05)
      Overall, this work concerns the intersection of machine learning and differential geometry. It investigates ways in which these fields can mutually inform each other. Our goal is to promote bringing a geometric paradigm ...