Tootfinder

Het zou me niet verbazen als het vertrouwen in het stemgedrag va de Nederlanders nog veel lager blijkt te zijn.
SCP: meerderheid Nederlanders gefrustreerd over de politiek https://nos.nl/l/2587111

SCP: meerderheid Nederlanders gefrustreerd over de politiek
Onderling geruzie en het uitblijven van oplossingen zorgen ervoor dat het vertrouwen in de politiek laag blijft, blijkt uit onderzoek van het Sociaal en Cultureel Planbureau.

This just made me laugh
https://scp-wiki.wikidot.com/the-foundation-fails-to-pass-a-budget
Partly because I have been making friends with the local Corvid population here and now when I walk the dog past the spot where I feed them they flock to me and gape…

Verification of Sequential Convex Programming for Parametric Non-convex Optimization
Rajiv Sambharya, Nikolai Matni, George Pappas
https://arxiv.org/abs/2511.10622 https://arxiv.org/pdf/2511.10622 https://arxiv.org/html/2511.10622
arXiv:2511.10622v1 Announce Type: new
Abstract: We introduce a verification framework to exactly verify the worst-case performance of sequential convex programming (SCP) algorithms for parametric non-convex optimization. The verification problem is formulated as an optimization problem that maximizes a performance metric (e.g., the suboptimality after a given number of iterations) over parameters constrained to be in a parameter set and iterate sequences consistent with the SCP update rules. Our framework is general, extending the notion of SCP to include both conventional variants such as trust-region, convex-concave, and prox-linear methods, and algorithms that combine convex subproblems with rounding steps, as in relaxing and rounding schemes. Unlike existing analyses that may only provide local guarantees under limited conditions, our framework delivers global worst-case guarantees--quantifying how well an SCP algorithm performs across all problem instances in the specified family. Applications in control, signal processing, and operations research demonstrate that our framework provides, for the first time, global worst-case guarantees for SCP algorithms in the parametric setting.
toXiv_bot_toot

A Small Collusion is All You Need
Yotam Gafni
https://arxiv.org/abs/2510.05986 https://arxiv.org/pdf/2510.05986

A Small Collusion is All You Need
Transaction Fee Mechanisms (TFMs) study auction design in the Blockchain context, and emphasize robustness against miner and user collusion, moreso than traditional auction theory. \cite{chung2023foundations} introduce the notion of a mechanism being $c$-Side-Contract-Proof ($c$-SCP), i.e., robust to a collusion of the miner and $c$ users. Later work \cite{chung2024collusion,welfareIncreasingCollusion} shows a gap between the $1$-SCP and $2$-SCP classes. We show that the class of $2$-SCP mechan…

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…

Sequential Convex Programming for 6-DoF Powered Descent Guidance with Continuous-Time Compound State-Triggered Constraints
Samet Uzun, Behcet Acikmese, John M. Carson III
https://arxiv.org/abs/2510.09610

Sequential Convex Programming for 6-DoF Powered Descent Guidance with Continuous-Time Compound State-Triggered Constraints
This paper presents a sequential convex programming (SCP) framework for ensuring the continuous-time satisfaction of compound state-triggered constraints, a subset of logical specifications, in the powered descent guidance (PDG) problem. The proposed framework combines the generalized mean-based smooth robustness measure (D-GMSR), a parameterization technique tailored for expressing discrete-time temporal and logical specifications through smooth functions, with the continuous-time successive c…

🇺🇦 #NowPlaying on KEXP's #VarietyMix
Rapsody feat. Keznamdi:
🎵 Never Enough
#Rapsody #Keznamdi
https://djbladetha1st.bandcamp.com/track/never-enough-feat-keznamdi-nicole-bus-scp-remix
https://open.spotify.com/track/6vDIWjqKuXi9XP4ZBWO9SX

A first-order method for constrained nonconvex--nonconcave minimax problems under a local Kurdyka-{\L}ojasiewicz condition
Zhaosong Lu, Xiangyuan Wang
https://arxiv.org/abs/2510.01168

A first-order method for constrained nonconvex--nonconcave minimax problems under a local Kurdyka-Łojasiewicz condition
We study a class of constrained nonconvex--nonconcave minimax problems in which the inner maximization involves potentially complex constraints. Under the assumption that the inner problem of a novel lifted minimax problem satisfies a local Kurdyka-Łojasiewicz (KL) condition, we show that the maximal function of the original problem enjoys a local Hölder smoothness property. We also propose a sequential convex programming (SCP) method for solving constrained optimization problems and establis…