Tootfinder

by accident i stumbled on this review by the #NSA on Bruce Schneiers "Applied Crypto" book from long ago.

Mit dem neuen #Solarthermiepark Au setzt #Tübingen ein starkes Zeichen für die #Wärmewende.
Auf 23.200 Quadratmetern erzeugt die Anlage jährlich rund 6 Millionen kWh

Sonne ab sofort Partnerin der Tübinger Wärmewende: Stadtwerke weihen Solarthermie-Park Au ein
Drittgrößte Anlage Deutschlands auf 23.000 Quadratmetern | Die Stadtwerke Tübingen (swt) haben jetzt eine der denkbar energiegeladensten Partnerinnen an ihrer Seite: Die Sonne. Sie sorgt ab sofort jährlich für sechs Millionen Kilowattstunden klimafreundliche Fernwärme. Die erzeugte Wärme kann viele Haushalte versorgen, die an das Fernwärmenetz angeschlossen sind. Die erste Solarthermie-Freiflächenanlage der swt ist gleichzeitig ein wichtiger Baustein für die Fernwärmetransformat…

Crosslisted article(s) found for math.OC. https://arxiv.org/list/math.OC/new
[1/1]:
- Optimal control of Volterra integral diffusions and application to contract theory
Dylan Possama\"i, Mehdi Talbi
https://arxiv.org/abs/2511.09701 https://mastoxiv.page/@arXiv_mathPR_bot/115547093766733637
- Generalized infinite dimensional Alpha-Procrustes based geometries
Salvish Goomanee, Andi Han, Pratik Jawanpuria, Bamdev Mishra
https://arxiv.org/abs/2511.09801 https://mastoxiv.page/@arXiv_statML_bot/115547135711272091
- Sample Complexity of Quadratically Regularized Optimal Transport
Alberto Gonz\'alez-Sanz, Eustasio del Barrio, Marcel Nutz
https://arxiv.org/abs/2511.09807 https://mastoxiv.page/@arXiv_mathST_bot/115546975796760368
- On the Convergence of Overparameterized Problems: Inherent Properties of the Compositional Struct...
Arthur Castello Branco de Oliveira, Dhruv Jatkar, Eduardo Sontag
https://arxiv.org/abs/2511.09810 https://mastoxiv.page/@arXiv_csLG_bot/115547543989283588
- Implicit Multiple Tensor Decomposition
Kunjing Yang, Libin Zheng, Minru Bai
https://arxiv.org/abs/2511.09916 https://mastoxiv.page/@arXiv_mathNA_bot/115547169767663335
- Theoretical Analysis of Resource-Induced Phase Transitions in Estimation Strategies
Takehiro Tottori, Tetsuya J. Kobayashi
https://arxiv.org/abs/2511.10184 https://mastoxiv.page/@arXiv_physicsbioph_bot/115546979073652600
- Zeroes and Extrema of Functions via Random Measures
Athanasios Christou Micheas
https://arxiv.org/abs/2511.10293 https://mastoxiv.page/@arXiv_statME_bot/115547493525198835
- Operator Models for Continuous-Time Offline Reinforcement Learning
Nicolas Hoischen, Petar Bevanda, Max Beier, Stefan Sosnowski, Boris Houska, Sandra Hirche
https://arxiv.org/abs/2511.10383 https://mastoxiv.page/@arXiv_statML_bot/115547254989932993
- On topological properties of closed attractors
Wouter Jongeneel
https://arxiv.org/abs/2511.10429 https://mastoxiv.page/@arXiv_mathDS_bot/115547276594491411
- Learning parameter-dependent shear viscosity from data, with application to sea and land ice
Gonzalo G. de Diego, Georg Stadler
https://arxiv.org/abs/2511.10452 https://mastoxiv.page/@arXiv_mathNA_bot/115547323782478749
- Formal Verification of Control Lyapunov-Barrier Functions for Safe Stabilization with Bounded Con...
Jun Liu
https://arxiv.org/abs/2511.10510 https://mastoxiv.page/@arXiv_eessSY_bot/115547429321496393
- Direction-of-Arrival and Noise Covariance Matrix joint estimation for beamforming
Vitor Gelsleichter Probst Curtarelli
https://arxiv.org/abs/2511.10639 https://mastoxiv.page/@arXiv_eessAS_bot/115547188796143762
toXiv_bot_toot

Global Solutions to Non-Convex Functional Constrained Problems with Hidden Convexity
Ilyas Fatkhullin, Niao He, Guanghui Lan, Florian Wolf
https://arxiv.org/abs/2511.10626 https://arxiv.org/pdf/2511.10626 https://arxiv.org/html/2511.10626
arXiv:2511.10626v1 Announce Type: new
Abstract: Constrained non-convex optimization is fundamentally challenging, as global solutions are generally intractable and constraint qualifications may not hold. However, in many applications, including safe policy optimization in control and reinforcement learning, such problems possess hidden convexity, meaning they can be reformulated as convex programs via a nonlinear invertible transformation. Typically such transformations are implicit or unknown, making the direct link with the convex program impossible. On the other hand, (sub-)gradients with respect to the original variables are often accessible or can be easily estimated, which motivates algorithms that operate directly in the original (non-convex) problem space using standard (sub-)gradient oracles. In this work, we develop the first algorithms to provably solve such non-convex problems to global minima. First, using a modified inexact proximal point method, we establish global last-iterate convergence guarantees with $\widetilde{\mathcal{O}}(\varepsilon^{-3})$ oracle complexity in non-smooth setting. For smooth problems, we propose a new bundle-level type method based on linearly constrained quadratic subproblems, improving the oracle complexity to $\widetilde{\mathcal{O}}(\varepsilon^{-1})$. Surprisingly, despite non-convexity, our methodology does not require any constraint qualifications, can handle hidden convex equality constraints, and achieves complexities matching those for solving unconstrained hidden convex optimization.
toXiv_bot_toot

Crosslisted article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- A quadratic-scaling algorithm with guaranteed convergence for quantum coupled-channel calculations
Hubert J. J\'o\'zwiak, Md Muktadir Rahman, Timur V. Tscherbul