Related papers: Optimality problems in Orlicz spaces
This paper studies simple bilevel problems, where a convex upper-level function is minimized over the optimal solutions of a convex lower-level problem. We first show the fundamental difficulty of simple bilevel problems, that the…
Fixed-point equations with Lipschitz operators have been studied for more than a century, and are central to problems in mathematical optimization, game theory, economics, and dynamical systems, among others. When the Lipschitz constant of…
We completely characterize the validity of the inequality $\|u\|_{Y(\mathbb{R}^n)}\leq C \|\nabla^m u\|_{X(\mathbb{R}^n)}$, where $X$ and $Y$ are rearrangement-invariant spaces, by reducing it to a considerably simpler one-dimensional…
Optimization problems arising in data science have given rise to a number of new derivative-based optimization methods. Such methods often use standard smoothness assumptions -- namely, global Lipschitz continuity of the gradient function…
We introduce a notion of inexact model of a convex objective function, which allows for errors both in the function and in its gradient. For this situation, a gradient method with an adaptive adjustment of some parameters of the model is…
An embedding theorem for Sobolev spaces built upon general Musielak-Orlicz norms is offered. These norms are defined in terms of generalized Young functions which also depend on the $x$ variable. Under minimal conditions on the latter…
In this article we prove both norm and modular Hardy inequalities for a class functions in one-dimensional fractional Orlicz-Sobolev spaces.
In this manuscript we study the following optimization problem: given a bounded and regular domain $\Omega\subset \mathbb{R}^N$ we look for an optimal shape for the "$\mathrm{W}-$vanishing window" on the boundary with prescribed measure…
New results and improvements in the study of nonparametric exponential and mixture models are proposed. In particular, different equivalent characterizations of maximal exponential models, in terms of open exponential arcs and Orlicz…
In this paper, we consider a finite-dimensional optimization problem minimizing a continuous objective on a compact domain subject to a multi-dimensional constraint function. For the latter, we assume the availability of a global Lipschitz…
In this paper we study the theory of the so-called Kantorovich max-product neural network operators in the setting of Orlicz spaces $L^{\varphi}$. The results here proved, extend those given by Costarelli and Vinti in Result Math., 2016, to…
We give necessary and sufficient conditions for the boundedness of generalized fractional integral and maximal operators on Orlicz-Morrey and weak Orlicz-Morrey spaces. To do this we prove the weak-weak type modular inequality of the…
In this paper, we consider the predual spaces of weak Orlicz spaces. As an application, we provide the Fefferman-Stein vector-valued maximal inequality for the weak Orlicz spaces. In order to prove this statement, we introduced the…
We study sharp growth conditions for the boundedness of the Hardy-Littlewood maximal function in the generalized Orlicz spaces. We assume that the generalized Orlicz function $\phi(x, t)$ satisfies the standard continuity properties (A0),…
In this paper we extend the theory of Henstock-Orlicz spaces with respect to vector measure. We study the integral representation of operators. Lastly we study Uniformly convexity, reflexivity and the Radon-Nikodym property of the…
Approximations of optimization problems arise in computational procedures and sensitivity analysis. The resulting effect on solutions can be significant, with even small approximations of components of a problem translating into large…
We consider image registration as an optimal control problem using an optical flow formulation, i.e., we discuss an optimization problem that is governed by a linear hyperbolic transport equation. Requiring Lipschitz continuity of the…
We study generalized Poincar\'e inequalities. We prove that if a function satisfies a suitable inequality of Poincar\'e type, then the Hardy-Littlewood maximal function also obeys a meaningful estimate of similar form. As a by-product, we…
Lower-bound analyses for nonconvex strongly-concave minimax optimization problems have shown that stochastic first-order algorithms require at least $\mathcal{O}(\varepsilon^{-4})$ oracle complexity to find an $\varepsilon$-stationary…
In this paper, we achieve new and improved numerical radius inequalities of operators defined on a Hilbert space by using Orlicz function and Hermite-Hadamard inequality. The upper bounds of various inequalities involving numerical radii…