Search

This paper examines a perturbed heavy ball system with vanishing damping that contains a Tikhonov regularization term in connection to the minimization problem of a convex Frechet differentiable fu...

We investigate an inertial algorithm of gradient type in connection with the minimization of a non-convex differentiable function. The algorithm is formulated in the spirit of Nesterov’s accelerated convex gradient method. We prove some abstract convergence results which applied to our numerical scheme allow us to show that the generated sequences converge to a critical point of the objective function, provided a regularization of the objective function satisfies the Kurdyka–Łojasiewicz property. Further, we obtain convergence rates for the generated sequences and the objective function values formulated in terms of the Łojasiewicz exponent of a regularization of the objective function. Finally, some numerical experiments are presented in order to compare our numerical scheme and some algorithms well known in the literature.

In this paper we deal with a general second order continuous dynamical system associated to a convex minimization problem with a Frechet differentiable objective function. We show that inertial algorithms, such as Nesterov’s algorithm, can be obtained via the natural explicit discretization from our dynamical system. Our dynamical system can be viewed as a perturbed version of the heavy ball method with vanishing damping, however the perturbation is made in the argument of the gradient of the objective function. This perturbation seems to have a smoothing effect for the energy error and eliminates the oscillations obtained for this error in the case of the heavy ball method with vanishing damping, as some numerical experiments show. We prove that the value of the objective function in a generated trajectory converges in order $$\mathcal {O}(1/t^2)$$ to the global minimum of the objective function. Moreover, we obtain that a trajectory generated by the dynamical system converges to a minimum point of the objective function.

The introduction of the Hessian damping in the continuous version of Nesterov's accelerated gradient method provides, by temporal discretization, fast proximal gradient algorithms where the oscilla...

We investigate an algorithm of gradient type with a backward inertial step in connection with the minimization of a nonconvex differentiable function. We show that the generated sequences converge to a critical point of the objective function, if a regularization of the objective function satisfies the Kurdyka-Łojasiewicz property. Further, we provide convergence rates for the generated sequences and the objective function values formulated in terms of the Łojasiewicz exponent. Finally, some numerical experiments are presented in order to compare our numerical scheme with some algorithms well known in the literature.

We investigate the asymptotic properties of the trajectories generated by a second-order dynamical system with Hessian driven damping and a Tikhonov regularization term in connection with the minimization of a smooth convex function in Hilbert spaces. We obtain fast convergence results for the function values along the trajectories. The Tikhonov regularization term enables the derivation of strong convergence results of the trajectory to the minimizer of the objective function of minimum norm.

In this paper, we investigate in a Hilbert space setting a second-order dynamical system of the form [Formula: see text] where [Formula: see text]image[Formula: see text] is a maximal monotone operator, [Formula: see text] is the resolvent operator of [Formula: see text] and [Formula: see text] are cocoercive operators, and [Formula: see text], and [Formula: see text] are step size, penalization and, respectively, damping functions, all depending on time. We show the existence and uniqueness of strong global solutions in the framework of the Cauchy–Lipschitz–Picard Theorem and prove ergodic asymptotic convergence for the generated trajectories to a zero of the operator [Formula: see text] where [Formula: see text] and [Formula: see text] denotes the normal cone operator of [Formula: see text]. To this end, we use Lyapunov analysis combined with the celebrated Opial Lemma in its ergodic continuous version. Furthermore, we show strong convergence for trajectories to the unique zero of [Formula: see text], provided that [Formula: see text] is a strongly monotone operator.

In this paper we propose a primal-dual dynamical approach to the minimization of a structured convex function consisting of a smooth term, a nonsmooth term, and the composition of another nonsmooth term with a linear continuous operator. In this scope we introduce a dynamical system for which we prove that its trajectories asymptotically converge to a saddle point of the Lagrangian of the underlying convex minimization problem as time tends to infinity. In addition, we provide rates for both the violation of the feasibility condition by the ergodic trajectories and the convergence of the objective function along these ergodic trajectories to its minimal value. Explicit time discretization of the dynamical system results in a numerical algorithm which is a combination of the linearized proximal method of multipliers and the proximal ADMM algorithm.

We propose a forward–backward proximal-type algorithm with inertial/memory effects for minimizing the sum of a nonsmooth function with a smooth one in the nonconvex setting. Every sequence of iterates generated by the algorithm converges to a critical point of the objective function provided an appropriate regularization of the objective satisfies the Kurdyka-Łojasiewicz inequality, which is for instance fulfilled for semi-algebraic functions. We illustrate the theoretical results by considering two numerical experiments: the first one concerns the ability of recovering the local optimal solutions of nonconvex optimization problems, while the second one refers to the restoration of a noisy blurred image.

We investigate a second-order dynamical system with variable damping in connection with the minimization of a nonconvex differentiable function. The dynamical system is formulated in the spirit of the differential equation which models Nesterov's accelerated convex gradient method. We show that the generated trajectory converges to a critical point, if a regularization of the objective function satisfies the Kurdyka- Lojasiewicz property. We also provide convergence rates for the trajectory formulated in terms of the Lojasiewicz exponent.

We investigate the asymptotic properties of the trajectories generated by a second-order dynamical system of proximal-gradient type stated in connection with the minimization of the sum of a nonsmooth convex and a (possibly nonconvex) smooth function. The convergence of the generated trajectory to a critical point of the objective is ensured provided a regularization of the objective function satisfies the Kurdyka–Łojasiewicz property. We also provide convergence rates for the trajectory formulated in terms of the Łojasiewicz exponent.

In the present work we show that the local generalized monotonicity of a lower semicontinuous set-valued operator on some certain type of dense sets ensures the global generalized monotonicity of that operator. We achieve this goal gradually by showing at first that the lower semicontinuous set-valued functions of one real variable, which are locally generalized monotone on a dense subsets of their domain are globally generalized monotone. Then, these results are extended to the case of set-valued operators on arbitrary Banach spaces. We close this work with a section on the global generalized convexity of a real valued function, which is obtained out of its local counterpart on some dense sets., Comment: 19 pages

In this paper, we provide sufficient conditions that ensure the convexity of the inverse images of an operator, monotone in some sense. Further, conditions that ensure the monotonicity, respectively the local injectivity of an operator, are also obtained. Combining the conditions that provide the local injectivity, respectively the convexity of the inverse images of an operator, we are able to obtain some global injectivity results. As applications, some new analytical conditions that assure the injectivity, respectively univalency of a complex function of one complex variable are obtained. We also show that some classical results, such as Alexander–Noshiro–Warschawski and Wolff theorem or Mocanu theorem, are easy consequences of our results.

In this paper, we establish some existence results of the solutions for several multivalued variational inequalities involving elements belonging to a class of operators that was recently introduced in the literature. As applications we obtain some new coincidence point results in Hilbert spaces.

In this paper we show that the local monotonicity in the sense of Minty and Browder on some residual sets assure the global monotonicity and, according to an earlier result, the convexity of the inverse images. We pay some special attention to the residual sets arising as complements of some special first Baire category sets, namely the \(\sigma \)-affine sets, the \(\sigma \)-compact sets and the \(\sigma \)-algebraic varieties. We achieve this goal gradually by showing, at first, that the continuous real valued functions of one real variable, which are locally nondecreasing on sets whose complements have no nonempty perfect subsets, are globally nondecreasing. The convexity of the inverse images combined with their discreteness, in the case of local injective operators, ensure the global injectivity. Note that the global monotonicity and the local injectivity of regular enough operators is guaranteed by the positive definiteness of the symmetric part of their Gâteaux differentials on the involved residual sets. We close this work with a short subsection on the global convexity which is obtained out of its local counterpart on some residual sets.

We give several regularity conditions, both closedness and interior point type, that ensure the maximal monotonicity of the generalized sum of two strongly-representable monotone operators, and we extend some recent results concerning on the same problem.

In this article we prove that the local increasing monotonicity of an operator on the complement of a certain type of closed set implies its global increasing monotonicity. As applications we obtain some global injectivity/convexity results based on local injectivity/convexity properties and some extra analytic requirements.

In this paper, we introduce a new class of operators. We present some fundamental properties of the operators belonging to this class and, as applications, we establish some existence results of the solutions for several general variational inequalities involving elements belonging to this class.

In this paper we provide sufficient conditions that ensure the existence of the solution of some vector equilibrium problems in Hausdorff topological vector spaces ordered by a cone. The conditions that we consider are imposed not on the whole domain of the operators involved, but rather on a self segment-dense subset of it, a special type of dense subset. We apply the results obtained to vector optimization and vector variational inequalities., Comment: arXiv admin note: substantial text overlap with arXiv:1405.2327

In the present work we deal with set-valued equilibrium problems for which we provide sufficient conditions for the existence of a solution. The conditions that we consider are imposed not on the whole domain, but rather on a self segment-dense subset of it, a special type of dense subset. As an application, we obtain a generalized Debreu-Gale-Nikaido-type theorem, with a considerably weakened Walras law in its hypothesis. Further, we consider a non-cooperative n-person game and prove the existence of a Nash equilibrium, under assumptions that are less restrictive than the classical ones., Comment: 21 pages

In this paper we introduce a new monotonicity concept for multivalued operators, respectively, a new convexity concept for real valued functions, which generalize several monotonicity, respectively, convexity notions already known in literature. We present some fundamental properties of the operators having this monotonicity property. We show that if such a monotonicity property holds locally then the same property holds globally on the whole domain of the operator. We also show that these two new concepts are closely related. As an immediate application we furnish some surjectivity results in finite dimensional spaces.

In this paper, by using a simple technique, we obtain several existence results of the solutions for general variational inequalities of Stampacchia type. We also show, that the existence of a coincidence point of two mappings is equivalent to the existence of the solution of a particular general variational inequality of Stampacchia type. As applications several coincidence and fixed point results are obtained.

In this paper we introduce two new generalized variational inequalities and we give some existence results of the solutions for these variational inequalities involving operators belonging to a recently introduced class of operators. We show by examples, that our results fail outside of this class. Further, we establish a result that may be viewed as a generalization of Minty’s theorem, that is, we show that under some circumstances the set of solutions of these variational inequalities coincide. We also show, the condition that the operators, involved in these variational inequalities, belong to the above mentioned class, is essential in obtaining this result. As application, we show that Brouwer’s fixed point theorem is an easy consequence of our results.