Search Results

Now showing 1 - 2 of 2
  • Item
    Relating a Rate-Independent System and a Gradient System for the Case of One-Homogeneous Potentials
    (New York, NY [u.a.] : Springer Science + Business Media B.V., 2021) Mielke, Alexander
    We consider a non-negative and one-homogeneous energy functional J on a Hilbert space. The paper provides an exact relation between the solutions of the associated gradient-flow equations and the energetic solutions generated via the rate-independent system given in terms of the time-dependent functional E(t,u)=tJ(u) and the norm as a dissipation distance. The relation between the two flows is given via a solution-dependent reparametrization of time that can be guessed from the homogeneities of energy and dissipations in the two equations. We provide several examples including the total-variation flow and show that equivalence of the two systems through a solution dependent reparametrization of the time. Making the relation mathematically rigorous includes a careful analysis of the jumps in energetic solutions which correspond to constant-speed intervals for the solutions of the gradient-flow equation. As a major result we obtain a non-trivial existence and uniqueness result for the energetic rate-independent system.
  • Item
    Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces
    (New York, NY [u.a.] : Springer Science + Business Media B.V., 2021) Geiersbach, Caroline; Scarinci, Teresa
    For finite-dimensional problems, stochastic approximation methods have long been used to solve stochastic optimization problems. Their application to infinite-dimensional problems is less understood, particularly for nonconvex objectives. This paper presents convergence results for the stochastic proximal gradient method applied to Hilbert spaces, motivated by optimization problems with partial differential equation (PDE) constraints with random inputs and coefficients. We study stochastic algorithms for nonconvex and nonsmooth problems, where the nonsmooth part is convex and the nonconvex part is the expectation, which is assumed to have a Lipschitz continuous gradient. The optimization variable is an element of a Hilbert space. We show almost sure convergence of strong limit points of the random sequence generated by the algorithm to stationary points. We demonstrate the stochastic proximal gradient algorithm on a tracking-type functional with a L1 -penalty term constrained by a semilinear PDE and box constraints, where input terms and coefficients are subject to uncertainty. We verify conditions for ensuring convergence of the algorithm and show a simulation.