Tootfinder

Den ganzen Sommer über hat die Kapuzinerkresse kein Blatt vors andere gebracht. Seit ein paar Wochen scheint sie neuen Lebensmut geschöpft zu haben.

Mein Dauerbegleiter als Sonnen- und #Wetterschutz ist ein #Buschhut.
Basecaps haben sich nicht bewehrt und Kapuzen behindern die Sicht. Mein Hut hat ein verstellbares Band gegen Wind und ist knautschfest. Er sieht auch nicht so komisch Cowboy-mäßig aus. Mehr dazu im Artikel.

@… OneKeePass and Secrets are reasonable Linux alternatives. I'm not wild about them, but I use Keepassium on my phone and would like to have an app on my Linux PC that uses the same format.

Eine einfache, aber schöne und vor allem essbare Pflanze. Immer wieder ein Hingucker im Garten.
#gartenfreude #fotosamstag

Unclear to me why no one ever mentions Strongbox in #PasswordManager reviews. It is a perfectly fine PM for macOS/iOS/iPadOS that has a rich set of sync options, most of which don't involve any 2nd/3rd party storage. It stores its databases in KeePass2.x (kdbx v4) format, so it is data-compatible with the many variations of KeePass.
(I use it with SSH/SCP sync, so as long as I’m at…

Cowboys will have to go through Micah Parsons and more to enter NFC Playoff Picture https://fansided.com/nfl/cowboys-will-have-to-go-through-micah-parsons-and-more-to-enter-nfc-playoff-picture-01kbb5vs6n53

Minimizing smooth Kurdyka-{\L}ojasiewicz functions via generalized descent methods: Convergence rate and complexity
Masoud Ahookhosh, Susan Ghaderi, Alireza Kabgani, Morteza Rahimi
https://arxiv.org/abs/2511.10414 https://arxiv.org/pdf/2511.10414 https://arxiv.org/html/2511.10414
arXiv:2511.10414v1 Announce Type: new
Abstract: This paper addresses the generalized descent algorithm (DEAL) for minimizing smooth functions, which is analyzed under the Kurdyka-{\L}ojasiewicz (KL) inequality. In particular, the suggested algorithm guarantees a sufficient decrease by adapting to the cost function's geometry. We leverage the KL property to establish the global convergence, convergence rates, and complexity. A particular focus is placed on the linear convergence of generalized descent methods. We show that the constant step-size and Armijo line search strategies along a generalized descent direction satisfy our generalized descent condition. Additionally, for nonsmooth functions by leveraging the smoothing techniques such as forward-backward and high-order Moreau envelopes, we show that the boosted proximal gradient method (BPGA) and the boosted high-order proximal-point (BPPA) methods are also specific cases of DEAL, respectively. It is notable that if the order of the high-order proximal term is chosen in a certain way (depending on the KL exponent), then the sequence generated by BPPA converges linearly for an arbitrary KL exponent. Our preliminary numerical experiments on inverse problems and LASSO demonstrate the efficiency of the proposed methods, validating our theoretical findings.
toXiv_bot_toot

🇺🇦 #NowPlaying on #KEXP's #DriveTime
Marvin Gaye:
🎵 Time to Get It Together
#MarvinGaye
https://mrsonnyjames.bandcamp.com/track/time-to-get-it-together-marvin-gaye
https://open.spotify.com/track/1hv3Xd35sNvZq7NS6l6Hfa
🎶 show playlist 👇
https://open.spotify.com/playlist/2KW4FxNKVGpVTgIJYolnNY
🎶 KEXP playlist 👇
https://open.spotify.com/playlist/6VNALrOa3gWbk794YuIrwg

„Hatte Kopfschmerzen!“ - Aneurysmen & Co.: Tickende Zeitbomben im Körper #News #Nachrichten…

Optimization of Base-n Radix Sort for Skewed Datasets
Atharv Pandey, Lakshmanan Kuppusamy
https://arxiv.org/abs/2509.19021 https://arxiv.org/pdf/2509.19021…