The Moreau envelope function and proximal mapping in the sense of the Bregman distance

In this paper, we explore some properties of the Moreau envelope function e_λf(x) of f and the associated proximal mapping P_λf(x) in the sense of the Bregman distance induced by a convex function g. Precisely, we study the continuity, differentiability, and Clarke regularity of the Moreau envelope function and the upper semicontinuity and single-valuedness of the proximal mapping as well as its relation to the convexity of λf+g, where λ is a positive parameter.     

Gap functions and global error bounds for differential variational–hemivariational inequalities

This paper concerns with the study of a differential variational–hemivariational inequality (DVHVI, for short) in infinite-dimensional Banach spaces. We first introduce the new concept of gap functions for the variational control system of (DVHVI). Then, we consider two kinds of gap functions which are regularized gap function and Moreau–Yosida regularized gap function, respectively, and examine the relevant properties of the gap functions. Moreover, two global error bounds which depend implicitly on the regularized gap function and the Moreau–Yosida regularized gap function, accordingly, are obtained. Finally, in order to illustrate the applicability of the theoretical results, we investigate a coupled dynamic system which is formulated by a nonlinear reaction–diffusion equation described by a time-dependent nonsmooth semipermeability problem.     

Subdifferential characterization of s-lower regular functions

As for Moreau envelopes of primal lower nice as well as prox-regular functions, Moreau s-envelopes of s-lower regular functions have been proved recently to have several remarkable differential properties and to have many important applications. Here, we provide a subdifferential characterization of extended real-valued s-lower regular functions on Banach spaces in terms of a hypomonotonicity-like property of the subdifferential.     

Epi-convergence: The Moreau Envelope and Generalized Linear-Quadratic Functions

This work explores the class of generalized linear-quadratic functions, constructed using maximally monotone symmetric linear relations. Calculus rules and properties of the Moreau envelope for this class of functions are developed. In finite dimensions, on a metric space defined by Moreau envelopes, we consider the epigraphical limit of a sequence of quadratic functions and categorize the results. We examine the question of when a quadratic function is a Moreau envelope of a generalized linear-quadratic function; characterizations involving nonexpansiveness and Lipschitz continuity are established. This work generalizes some results by Hiriart-Urruty and by Rockafellar and Wets.     

Prox-regular functions in variational analysis

The class of prox-regular functions covers all l.s.c., proper, convex functions, lower- functions and strongly amenable functions, hence a large core of functions of interest in variational analysis and optimization. The subgradient mappings associated with prox-regular functions have unusually rich properties, which are brought to light here through the study of the associated Moreau envelope functions and proximal mappings. Connections are made between second-order epi-derivatives of the functions and proto-derivatives of their subdifferentials. Conditions are identified under which the Moreau envelope functions are convex or strongly convex, even if the given functions are not.

     

Convergence analysis of a proximal newton method 1

Recently Fukushima and Qi proposed a proximal Newton method for minimizating a nonsmooth convex function. An alternative global convergence proof for that method is presented in this paper. Global convergence was established without any additional assumption on the objective function. We also show that the infimum of a convex function is always equal to the infimun of its Moreau—Yosida regularization     

Fast Moreau envelope computation I: numerical algorithms

The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents a new linear-time algorithm, named NEP for NonExpansive Proximal mapping. Numerical comparisons between the NEP and two existing algorithms: The Linear-time Legendre Transform (LLT) and the Parabolic Envelope (PE) algorithms are performed. Worst-case time complexity, convergence results, and examples are included. The fast Moreau envelope algorithms first factor the Moreau envelope as several one-dimensional transforms and then reduce the brute force quadratic worst-case time complexity to linear time by using either the equivalence with Fast Legendre Transform algorithms, the computation of a lower envelope of parabolas, or, in the convex case, the non expansiveness of the proximal mapping.      

Banach空间上凸函数项级数

本文研究了Ｂａｎａｃｈ空间上凸函数项级数，给出了Ｍｏｒｅａｕ Ｒｏｃｋａｆｅｌａｒ定理的推广，做为它的应用，获得了Ｋｕｈｎ Ｔｕｃｋｅｒ定理的一个部分推广．     

拟线性可化约的双曲型方程组的奇性分析

In this paper we investigate the formation of singularities of hyperbolic systems. Employing the method of parametric coordinates and the existence of the solution of the blow-up system, we prove that the blow-up of classic solutions is due to the envelope of characteristics of the same family, analyze the geometric properties of the envelope of characteristics and estimate the blowup rates of the solution precisely.     

The convex envelope is the solution of a nonlinear obstacle problem

We derive a nonlinear partial differential equation for the convex envelope of a given function. The solution is interpreted as the value function of an optimal stochastic control problem. The equation is solved numerically using a convergent finite difference scheme.

     

常微分方程奇解的讨论

对常微分方程教科书中采用的不同方式来定义奇解进行了讨论，指出了用包络定义奇解的不相容性和用唯一性被破坏定义奇解的合理性．     

Preconditioners for state‐constrained optimal control problems with Moreau–Yosida penalty function

Optimal control problems with partial differential equations as constraints play an important role in many applications. The inclusion of bound constraints for the state variable poses a significant challenge for optimization methods. Our focus here is on the incorporation of the constraints via the Moreau–Yosida regularization technique. This method has been studied recently and has proven to be advantageous compared with other approaches. In this paper, we develop robust preconditioners for the efficient solution of the Newton steps associated with the fast solution of the Moreau–Yosida regularized problem. Numerical results illustrate the efficiency of our approach. Copyright © 2012 John Wiley & Sons, Ltd.     

A Bregman projection method for approximating fixed points of quasi-Bregman nonexpansive mappings

We introduce an abstract algorithm that aims to find the Bregman projection onto a closed convex set. As an application, the asymptotic behavior of an iterative method for finding a fixed point of a quasi-Bregman nonexpansive mapping with the fixed-point closedness property is analyzed. We also show that our result is applicable to Bregman subgradient projectors.     

反射型的带跳倒向双重随机微分方程

证明了反射型的带跳倒向双重随机微分方程的解的存在唯一性.主要方法是Snell包和不动点定理.     

On the Complexity of the Projective Splitting and Spingarn’s Methods for the Sum of Two Maximal Monotone Operators

A local convergence result for an abstract descent method is proved. The sequence of iterates is attracted by a local (or global) minimum, stays in its neighborhood, and converges within this neighborhood. This result allows algorithms to exploit local properties of the objective function. In particular, the abstract theory in this paper applies to the inertial forward–backward splitting method: iPiano—a generalization of the Heavy-ball method. Moreover, it reveals an equivalence between iPiano and inertial averaged/alternating proximal minimization and projection methods. Key for this equivalence is the attraction to a local minimum within a neighborhood and the fact that, for a prox-regular function, the gradient of the Moreau envelope is locally Lipschitz continuous and expressible in terms of the proximal mapping. In a numerical feasibility problem, the inertial alternating projection method significantly outperforms its non-inertial variants.     

由Lévy过程驱动的双重反射型倒向随机微分方程(英文)

证明了由Lévy过程驱动的双重反射型倒向随机微分方程解的存在唯一性.主要方法是Snell包络和不动点定理.     

Prox-regular functions in Hilbert spaces

This paper studies the prox-regularity concept for functions in the general context of Hilbert space. In particular, a subdifferential characterization is established as well as several other properties. It is also shown that the Moreau envelopes of such functions are continuously differentiable.     

On Chebyshev functions and Klee functions

Associated to a lower semicontinuous function, one can define its proximal mapping and farthest mapping. The function is called Chebyshev (Klee) if its proximal mapping (farthest mapping) is single-valued everywhere. We show that the function f is 1/λ-hypoconvex if its proximal mapping Pλf is single-valued. When the function f is bounded below, and Pλf is single-valued for every λ>0, the function must be convex. Similarly, we show that the function f is 1/μ-strongly convex if the farthest mapping Qμf is single-valued. When the function is the indicator function of a set, this recovers the well-known Chebyshev problem and Klee problem in Rn. We also give an example illustrating that a continuous proximal mapping (farthest mapping) needs not be locally Lipschitz, which answers one open question by Hare and Poliquin.     

Existence and sum decomposition of vertex polyhedral convex envelopes

Convex envelopes are a very useful tool in global optimization. However finding the exact convex envelope of a function is a difficult task in general. This task becomes considerably simpler in the case where the domain is a polyhedron and the convex envelope is vertex polyhedral, i.e., has a polyhedral epigraph whose vertices correspond to the vertices of the domain. A further simplification is possible when the convex envelope is sum decomposable, i.e., the convex envelope of a sum of functions coincides with the sum of the convex envelopes of the summands. In this paper we provide characterizations and sufficient conditions for the existence of a vertex polyhedral convex envelope. Our results extend and unify several results previously obtained for special cases of this problem. We then characterize sum decomposability of vertex polyhedral convex envelopes, and we show, among else, that the vertex polyhedral convex envelope of a sum of functions coincides with the sum of the vertex polyhedral convex envelopes of the summands if and only if the latter sum is vertex polyhedral.