Results 61 to 70 of about 15,586 (220)
On the 85th Birthday Anniversary of the RAS Corresponding Member, Professor A. A. Tolstonogov
Известия Иркутского государственного университета: Серия "Математика"The paper is dedicated to the scientific and scientific-pedagogical activities of the professor, Corresponding Member of the Russian Academy of Sciences A. A. Tolstonogov, who turns 85 in March 2025.
I.V. Bychkov +4 more
doaj +1 more source
Conformal optimization of eigenvalues on surfaces with symmetries
Journal of the London Mathematical Society, Volume 112, Issue 6, December 2025.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
Viable solutions to nonautonomous inclusions without convexity [PDF]
, 2003 The existence of viable solutions is proven for nonautonomous upper semicontinuous differential inclusions whose right-hand side is contained in the Clarke subdifferential of a locally Lipschitz continuous ...
Kánnai, Zoltán, Tallos, Péter
core
Superlinear perturbations of a double‐phase eigenvalue problem
Transactions of the London Mathematical Society, Volume 12, Issue 1, December 2025.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
International Journal for Numerical Methods in Engineering, Volume 126, Issue 21, 15 November 2025.ABSTRACT Although finite elements were made available for FFT‐based computational homogenization methods, they are seldomly used for inelastic computations because traditionally the constitutive law is evaluated at each quadrature point of the element, making the storage of that many internal variables necessary, as well.
Flavia Gehrig, Matti Schneider
wiley +1 more source
A Relaxed Version of the Cutting Method with Approximation of the Constraint Region
Учёные записки Казанского университета: Серия Физико-математические наукиA cutting method was proposed for solving the convex programming problem. The method assumes that the constraint region of the problem is embedded into some polyhedral sets for constructing iteration points.
I. Ya. Zabotin +2 more
doaj +1 more source
Algorithmic Construction of the Subdifferential from Directional Derivatives [PDF]
, 2016 The subdifferential of a function is a generalization for nonsmooth functions of the concept of gradient. It is frequently used in variational analysis, particularly in the context of nonsmooth optimization.
Charles Audet, W. Hare
semanticscholar +1 more source
Subdifferentiability of Real Functions
Real Analysis Exchange, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Optimal Control Applications and Methods, Volume 46, Issue 6, Page 2595-2611, November/December 2025.Optimal Control of AB Caputo Fractional Stochastic Integrodifferential Control System with Noninstantaneous Impulses. ABSTRACT This study is concerned with the existence of mild solution and optimal control for the Atangana–Baleanu fractional stochastic integrodifferential system with noninstantaneous impulses in Hilbert spaces. We verify the existence
Murugesan Johnson +2 more
wiley +1 more source
Structured Nuclear Norm Matrix Completion: Guaranteeing Exact Recovery via Block‐Column Scaling
Numerical Linear Algebra with Applications, Volume 32, Issue 4, August 2025.ABSTRACT The goal of low‐rank matrix completion is to minimize the rank of a matrix while adhering to the constraint that known (non‐missing) elements are fixed in the approximation. Minimizing rank is a difficult, non‐convex, NP‐hard problem, often addressed by substituting rank with the nuclear norm to achieve a convex relaxation.
Konstantin Usevich +3 more
wiley +1 more source