Zobrazeno 1 - 10
of 683
pro vyhledávání: '"Hager, A. W."'
Autor:
Ball, R. N., Hager, A. W.
In the category \(\mathbf{V}\) of unital archimedean vector lattices, four notions of uniform completeness obtain. In all cases completeness requires the convergence of uniformly Cauchy sequences; the completions are distinguished by the manner in wh
Externí odkaz:
http://arxiv.org/abs/2412.06998
A $d$-subgroup of a lattice-ordered group ($\ell$-group) $G$ is a subgroup that contains the principal polars generated by each of its elements. We call $G$ a Martinez $\ell$-group if every convex $\ell$-subgroup of $G$ is a $d$-subgroup (equivalentl
Externí odkaz:
http://arxiv.org/abs/2410.11930
$\bf{W}^*$ is the category of the archimedean l-groups with distinguished strong order unit and unit-preserving l-group homomorphisms. For $G \in \bf{W}^*$, we have the canonical compact space $YG$, and Yosida representation $G \leq C(YG)$, thus, for
Externí odkaz:
http://arxiv.org/abs/2404.18752
Autor:
Hager, Anthony W., Wynne, Brian
The property of a vector lattice of sufficiently many projections (SMP) is informed by restricting attention to archimedean $A$ with a distinguished weak order unit $u$ (the class, or category, $\bf{W}$), where the Yosida representation $A \leq D(Y(A
Externí odkaz:
http://arxiv.org/abs/2404.17628
Autor:
Hager, William W.
In an earlier paper (https://doi.org/10.1137/21M1393315), the Switch Point Algorithm was developed for solving optimal control problems whose solutions are either singular or bang-bang or both singular and bang-bang, and which possess a finite number
Externí odkaz:
http://arxiv.org/abs/2307.09722
Autor:
Hager, William W., Zhang, Hongchao
Publikováno v:
ACM Transactions on Mathematical Software, 2023
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
Externí odkaz:
http://arxiv.org/abs/2202.05353
Autor:
Diffenderfer, James, Hager, William W.
In this paper, we present a two phase method for solving nonlinear programming problems called Nonlinear Polyhedral Active Set Algorithm (NPASA) that has global and local convergence guarantees under reasonable assumptions. The first phase consists o
Externí odkaz:
http://arxiv.org/abs/2107.07479
Autor:
Diffenderfer, James, Hager, William W.
In this paper, we provide local convergence analysis for the two phase Nonlinear Polyhedral Active Set Algorithm (NPASA) designed to solve nonlinear programs. In particular, we establish local quadratic convergence of the primal iterates and global e
Externí odkaz:
http://arxiv.org/abs/2107.07478
Publikováno v:
In Topology and its Applications 1 February 2024 342
Autor:
Aghaee, Mahya, Hager, William W.
Publikováno v:
SIAM Journal on Control and Optimization, 59 (2021), 2570-2593
The Switch Point Algorithm is a new approach for solving optimal control problems whose solutions are either singular or bang-bang or both singular and bang-bang, and which possess a finite number of jump discontinuities in an optimal control at the
Externí odkaz:
http://arxiv.org/abs/2011.10022