Searcharxiv⌕ Search

arXiv subjects

Narin Petrot

Publications and source records attributed to Narin Petrot.

5 recordsLinked to original sources
arXiv2020

Incremental proximal gradient scheme with penalization for constrained composite convex optimization problems

We consider the problem of minimizing a finite sum of convex functions subject to the set of minimizers of a convex differentiable function. In order to solve the problem, an algorithm combining the incremental proximal gradient method with smooth penalization technique is proposed. We show the convergence of the generated sequence of iterates to an optimal solution of the optimization problems, provided that a condition expressed via the Fenchel conjugate of the constraint function is fulfilled. Finally, the functionality of the method is illustrated by some numerical experiments addressing image inpainting problems and generalized Heron problems with least squares constraints.

math.OC↗
arXiv2020

Star subgradient projection for solving quasi-convex feasibility problems

In this work we consider an iterative method for solving the quasi-convex feasibility problem. We firstly introduce the so-called star subgradient projection operator and present some useful properties. We subsequently obtain a convergence result of the considered method by using properties of the introduced nonlinear operator.

math.OC↗
arXiv2018

Generalized Forward-Backward Splitting with Penalization for Monotone Inclusion Problems

We introduce a generalized forward-backward splitting method with penalty term for solving monotone inclusion problems involving the sum of a finite number of maximally monotone operators and the normal cone to the nonempty set of zeros of another maximal monotone operator. We show weak ergodic convergence of the generated sequence of iterates to a solution of the considered monotone inclusion problem, provided the condition corresponded to the Fitzpatrick function of the operator describing the set of the normal cone is fulfilled. Under strong monotonicity of an operator, we show strong convergence of the iterates. Furthermore, we utilize the proposed method for minimizing a large-scale hierarchical minimization problem concerning the sum of differentiable and nondifferentiable convex functions subject to the set of minima of another differentiable convex function. We illustrate the functionality of the method through numerical experiments addressing constrained elastic net and generalized Heron location problems.

math.OC↗
arXiv2006

Basic topological and geometric properties of Cesàro--Orlicz spaces

Necessary and sufficient conditions under which the Cesàro--Orlicz sequence space $\cfi$ is nontrivial are presented. It is proved that for the Luxemburg norm, Cesàro--Orlicz spaces $\cfi$ have the Fatou property. Consequently, the spaces are complete. It is also proved that the subspace of order continuous elements in $\cfi$ can be defined in two ways. Finally, criteria for strict monotonicity, uniform monotonicity and rotundity (= strict convexity) of the spaces $\cfi$ are given.

math.FA↗