Search arXiv⌕ Search

arXiv · 2610.07844

GPU-accelerated wind farm layout search with a distilled endogenous wake model (EndoWake)

Abstract

Wind farm layout optimization decides where to place turbines to maximize annual energy production, and wake effects decide how much of that energy is produced. Accurate wake models are too slow for a search. We build on EndoWake, an endogenous wake model in which the wind speed at every grid cell is a variable linked to its upwind neighbors by linear constraints, so that wake field, siting decisions and project constraints share one mixed-integer model. Its four parameters are calibrated once against the single-wake field of a Reynolds-averaged Navier-Stokes (RANS) simulation, and a GPU scores over a million layouts per second per wind direction. Comparing EndoWake-guided searches with a PyWake-based pipeline at Lillgrund, under a RANS judge that no search calls, revealed that the fidelity of a wake model is not the quality of the layouts optimized under it. A search is drawn to the gaps between sampled wind directions, the sirens; a diagnostic of the field finds a second artifact, an optimistic band off each wake edge, the mermaid cells, not reported before to our knowledge. Judged at random directions, the two pipelines are statistically indistinguishable. Our main result puts this speed to use: EndoWake screens the candidate moves of a local search on the GPU, and PyWake confirms every accepted move. On twenty unseen starts, with one GPU and thirty CPU processes, this screen-and-confirm search matches the PyWake value of a search on PyWake alone 7.9 times faster, and 14.9 times faster on the annual energy.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Martina Fischetti, Matteo Fischetti. 2026-10-06. GPU-accelerated wind farm layout search with a distilled endogenous wake model (EndoWake). https://arxiv.org/abs/2610.07844

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Multilevel Regularized Newton Methods with Fast Convergence Rates

We introduce new multilevel methods for solving large-scale unconstrained optimization problems. Specifically, the philosophy of multilevel methods is applied to Newton-type methods that regularize the Newton sub-problem using second order information from a coarse (low dimensional) sub-problem. The new \emph{regularized multilevel methods} provably converge from any initialization point and enjoy faster convergence rates than Gradient Descent. In particular, for arbitrary functions with Lipschitz continuous Hessians, we show that their convergence rate interpolates between the rate of Gradient Descent and that of the cubic Newton method. If, additionally, the objective function is assumed to be convex, then the proposed method converges with the fast $\mathcal{O}(k^{-2})$ rate. Hence, since the updates are generated using a \emph{coarse} model in low dimensions, the theoretical results of this paper significantly speed-up the convergence of Newton-type or preconditioned gradient methods in practical applications. Preliminary numerical results suggest that the proposed multilevel algorithms are significantly faster than current state-of-the-art methods.

math.OC↗

Adaptive Algorithms for Robust Phase Retrieval

This paper considers robust phase retrieval, which can be cast as a nonsmooth and nonconvex optimization problem. We propose two first-order algorithms with adaptive step sizes: the subgradient algorithm (AdaSubGrad) and the inexact proximal linear algorithm (AdaIPL). Our contribution lies in a novel design of adaptive step sizes based on quantiles of the absolute residuals. We analyze local linear convergence of both algorithms across different hyperparameter regimes under i.i.d. centered sub-Gaussian measurements, a stability condition linking the measurement distribution and the corruption level, and an additional uniform small-ball condition. Numerical experiments on synthetic datasets and image recovery also demonstrate that our methods are competitive with existing methods in the literature that utilize predetermined (possibly impractical) step sizes, such as subgradient methods and the inexact proximal linear method.

math.OC↗

A Simple yet Highly Accurate Prediction-Correction Algorithm for Time-Varying Optimization

This paper proposes a simple yet highly accurate prediction-correction algorithm, SHARP, for unconstrained time-varying optimization problems. Its prediction is based on an extrapolation derived from the Lagrange interpolation of past solutions. Since this extrapolation can be computed without Hessian matrices or even gradients, the computational cost is low. To ensure the stability of the prediction, the algorithm includes an acceptance condition that rejects the prediction when the update is excessively large. The proposed method achieves a tracking error of $O(h^{p})$, where $h$ is the sampling period, assuming that the $p$-th derivative of the target trajectory is bounded and the convergence of the correction step is locally linear. We also prove that the method can track a trajectory of stationary points even if the objective function is non-convex. Numerical experiments demonstrate the high accuracy of the proposed algorithm.

math.OC↗