Zobrazeno 1 - 10
of 203
pro vyhledávání: '"William W. Hager"'
Publikováno v:
Mathematical Biosciences and Engineering, Vol 21, Iss 5, Pp 6123-6149 (2024)
In this paper, we investigate an optimal harvesting problem of a spatially explicit fishery model that was previously analyzed. On the surface, this problem looks innocent, but if parameters are set to where a singular arc occurs, two complex questio
Externí odkaz:
https://doaj.org/article/369c553fd5e34ff4b35591152b7cf0b0
Publikováno v:
Frontiers in Nutrition, Vol 10 (2023)
IntroductionRunners competing in races are looking to optimize their performance. In this paper, a runner's performance in a race, such as a marathon, is formulated as an optimal control problem where the controls are: the nutrition intake throughout
Externí odkaz:
https://doaj.org/article/bee3c2414717404596e942eaea2759b9
Publikováno v:
Mathematical Programming.
For polyhedral constrained optimization problems and a feasible point $$\textbf{x}$$ x , it is shown that the projection of the negative gradient on the tangent cone, denoted $$\nabla _\varOmega f(\textbf{x})$$ ∇ Ω f ( x ) , has an orthogonal deco
Autor:
William W. Hager, Hongchao Zhang
Publikováno v:
ACM Transactions on Mathematical Software.
The Polyhedral Active Set Algorithm (PASA) is designed to optimize a general nonlinear function over a polyhedron. Phase one of the algorithm is a nonmonotone gradient projection algorithm, while phase two is an active set algorithm that explores fac
Publikováno v:
Optimal Control Applications and Methods. 42:1119-1140
A mesh refinement method is described for solving optimal control problems using Legendre-Gauss-Radau collocation. The method detects discontinuities in the control solution by employing an edge detection scheme based on jump function approximations.
Publikováno v:
Journal of Optimization Theory and Applications. 191:600-633
A new method is developed for solving optimal control problems whose solutions are nonsmooth. The method developed in this paper employs a modified form of the Legendre–Gauss–Radau orthogonal direct collocation method. This modified Legendre–Ga
Publikováno v:
ACM Transactions on Mathematical Software. 46:1-18
Partitioning graphs is a common and useful operation in many areas, from parallel computing to VLSI design to sparse matrix algorithms. In this article, we introduce Mongoose, a multilevel hybrid graph partitioning algorithm and library. Building on
Computational Method for Optimal Guidance and Control Using Adaptive Gaussian Quadrature Collocation
Publikováno v:
Journal of Guidance, Control, and Dynamics. 42:2026-2041
A method is described for computational optimal guidance and control using adaptive Gaussian quadrature collocation and sparse nonlinear programming. The method employs adaptive Legendre–Gauss–Rada...
Publikováno v:
Computational Optimization and Applications. 74:259-273
Bounds are established for integration matrices that arise in the convergence analysis of discrete approximations to optimal control problems based on orthogonal collocation. Weighted Euclidean norm bounds are derived for both Gauss and Radau integra
An inexact accelerated stochastic Alternating Direction Method of Multipliers (AS-ADMM) scheme is developed for solving structured separable convex optimization problems with linear constraints. The objective function is the sum of a possibly nonsmoo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa58d14462a243964e3dfb37909d96ec
http://arxiv.org/abs/2010.12765
http://arxiv.org/abs/2010.12765