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 5 of 5 for “"Nonconvex functional"”.

  1. A monotone follower control problem with a nonconvex functional and some related problems

    … monotone follower control problem with a nonconvex functional is considered. The controls are assumed to be nonnegative progressively measurable processes. The verification theorem for this problem is presented. A specific monotone follower control problem with a nonconvex functional is …

    lsu-thes Repository record for A monotone follower control problem with a nonconvex functional and some related problems (opens in a new tab)

  2. FIRST-ORDER METHODS FOR NONSMOOTH NONCONVEX FUNCTIONAL CONSTRAINED OPTIMIZATION WITH OR WITHOUT SLATER POINTS

    … objective and constraints may be nonsmooth and nonconvex arise across many learning and data science settings. In this paper, we show a simple first-order method finds a feasible, ϵ-stationary point at a convergence rate of O(ϵ−4) without relying on compactness or Constraint Qualification (CQ). …

    jhu Repository record for FIRST-ORDER METHODS FOR NONSMOOTH NONCONVEX FUNCTIONAL CONSTRAINED OPTIMIZATION WITH OR WITHOUT SLATER POINTS (opens in a new tab)

  3. Convex relaxations of a continuum aggregation model, and their efficient numerical solution

    … rate function (the Helmholtz free energy functional) for the Boltzmann distribution is discussed. The Helmholtz functional arises in large systems of interacting particles — which are widely used as models in computational chemistry and molecular dynamics. Global minimizers of the rate …

    njit Repository record for Convex relaxations of a continuum aggregation model, and their efficient numerical solution (opens in a new tab)

  4. Risk neutral and risk averse stochastic optimization

    … Chapter 5-6 deal with a class of single-stage functional constrained stochastic optimization problems. First, we investigate the deterministic upper bound of a Multistage Stochastic Linear Program (MSLP). We first present the Dual SDDP algorithm, which solves the Dynamic Programming equations …

    gatech Repository record for Risk neutral and risk averse stochastic optimization (opens in a new tab)