Results 51 to 60 of about 6,758 (185)
This paper defines a strong convertible nonconvex (SCN) function for solving the unconstrained optimization problems with the nonconvex or nonsmooth (nondifferentiable) function. First, the concept of SCN function is defined, where the SCN functions are nonconvex or nonsmooth.
Min Jiang +4 more
wiley +1 more source
This article develops new Hermite–Hadamard and Jensen‐type inequalities for the class of (α, m)‐convex functions. New product forms of Hermite–Hadamard inequalities are established, covering multiple distinct scenarios. Several nontrivial examples and remarks illustrate the sharpness of these results and demonstrate how earlier inequalities can be ...
Shama Firdous +5 more
wiley +1 more source
We address the generalized aggregative equilibrium seeking problem for noncooperative agents playing average aggregative games with affine coupling constraints.
Belgioioso, Giuseppe, Grammatico, Sergio
core +1 more source
Robust multitask feature learning with adaptive Huber regressions
Abstract When data from multiple tasks have outlier contamination, existing multitask learning methods perform less efficiently. To address this issue, we propose a robust multitask feature learning method by combining the adaptive Huber regression tasks with mixed regularization. The robustification parameters can be chosen to adapt to the sample size,
Yuan Zhong, Xin Gao, Wei Xu
wiley +1 more source
A Semismooth Newton Method for Tensor Eigenvalue Complementarity Problem
In this paper, we consider the tensor eigenvalue complementarity problem which is closely related to the optimality conditions for polynomial optimization, as well as a class of differential inclusions with nonconvex processes.
Chen, Zhongming, Qi, Liqun
core +1 more source
Subdifferential calculus for a quasiconvex function with generator
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Suzuki, Satoshi, Kuroiwa, Daishi
openaire +1 more source
Learning in random utility models via online decision problems
Abstract This paper examines the Random Utility Model (RUM) in repeated stochastic choice settings where decision‐makers lack full information about payoffs. We propose a gradient‐based learning algorithm that embeds RUM into an online decision‐making framework.
Emerson Melo
wiley +1 more source
We prove that every function $f:\mathbb{R}^n\to \mathbb{R}$ satisfies that the image of the set of critical points at which the function $f$ has Taylor expansions of order $n-1$ and non-empty subdifferentials of order $n$ is a Lebesgue-null set.
Azagra, Daniel +2 more
core +1 more source
Conformal optimization of eigenvalues on surfaces with symmetries
Abstract Given a conformal action of a discrete group on a Riemann surface, we study the maximization of Laplace and Steklov eigenvalues within a conformal class, considering metrics invariant under the group action. We establish natural conditions for the existence and regularity of maximizers. Our method simplifies the previously known techniques for
Denis Vinokurov
wiley +1 more source
Superlinear perturbations of a double‐phase eigenvalue problem
Abstract We consider a perturbed version of an eigenvalue problem for the double‐phase operator. The perturbation is superlinear, but need not satisfy the Ambrosetti–Robinowitz condition. Working on the Sobolev–Orlicz space W01,η(Ω)$ W^{1,\eta }_{0}(\Omega)$ with η(z,t)=α(z)tp+tq$ \eta (z,t)=\alpha (z)t^{p}+t^{q}$ for 1
Yunru Bai +2 more
wiley +1 more source

