Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.08374

Spatially Explicit Optimal Harvesting and Adjoint-Based Diagnostics for Nonlinear Biomass Dynamics

Tin Nwe Aye·Wolfgang Bock
View original source ↗Read source document ↗Export metadata ↓

Abstract

We develop a spatially explicit nonlinear biomass model for exploited fish populations incorporating density-dependent Beverton-Holt production, natural mortality, diffusion driven spatial movement, and harvesting. Starting from a reduced biomass model motivated by spawning stock biomass data, we derive a reaction-diffusion model with Neumann boundary conditions and spatially distributed harvesting. We establish positivity, boundedness, and well-posedness of the biomass dynamics, and identify a critical harvesting threshold separating persistence and extinction regimes of spatially homogeneous equilibria. A distributed optimal harvesting problem is then formulated, and the corresponding state-adjoint optimality system and pointwise projection characterization of the harvesting control are derived. The adjoint variable provides a measure of the marginal future value of biomass within the harvesting objective and offers a diagnostic that complements biomass abundance alone. Numerical simulations examine the coupled evolution of biomass, the adjoint variable, and optimal harvesting effort. The results show that diffusion progressively reduces the initial spatial heterogeneity in biomass, while the computed adjoint and optimal harvesting fields exhibit limited spatial variation under the parameter regime considered. These results illustrate how the coupled state-adjoint-control framework links spatial biomass dynamics with future management value and harvesting decisions.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tin Nwe Aye, Wolfgang Bock. 2026-10-06. Spatially Explicit Optimal Harvesting and Adjoint-Based Diagnostics for Nonlinear Biomass Dynamics. https://arxiv.org/abs/2610.08374

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗