Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Biobjective mixed integer optimization (1)
- Branching (1)
- Brownian Motion (1)
- Circular minor (1)
- Circular network (1)
-
- Circular pair (1)
- Circular planar (1)
- Complex analysis (1)
- Electrical network (1)
- Fathoming (1)
- Fourier collocation (1)
- Kron reduction (1)
- Mathematical physics (1)
- Momentum (1)
- Nesterov acceleration (1)
- Nonlinear PDE (1)
- Number theory (1)
- Parametric linear complementarity problem (1)
- Parametric quadratic program (1)
- Precondition (1)
- Pseudo spectral (1)
- Ramanujan (1)
- Random Walks (1)
- Set dominance (1)
- Stochastic Processes in Finance (1)
- Publication
- Publication Type
Articles 1 - 6 of 6
Full-Text Articles in Other Applied Mathematics
An Algorithm For Biobjective Mixed Integer Quadratic Programs, Pubudu Jayasekara Merenchige
An Algorithm For Biobjective Mixed Integer Quadratic Programs, Pubudu Jayasekara Merenchige
All Dissertations
Multiobjective quadratic programs (MOQPs) are appealing since convex quadratic programs have elegant mathematical properties and model important applications. Adding mixed-integer variables extends their applicability while the resulting programs become global optimization problems. Thus, in this work, we develop a branch and bound (BB) algorithm for solving biobjective mixed-integer quadratic programs (BOMIQPs). An algorithm of this type does not exist in the literature.
The algorithm relies on five fundamental components of the BB scheme: calculating an initial set of efficient solutions with associated Pareto points, solving node problems, fathoming, branching, and set dominance. Considering the properties of the Pareto set of …
Connecting People To Food: A Network Approach To Alleviating Food Deserts, Anna Sisk
Connecting People To Food: A Network Approach To Alleviating Food Deserts, Anna Sisk
Annual Symposium on Biomathematics and Ecology Education and Research
No abstract provided.
Preconditioned Nesterov’S Accelerated Gradient Descent Method And Its Applications To Nonlinear Pde, Jea Hyun Park
Preconditioned Nesterov’S Accelerated Gradient Descent Method And Its Applications To Nonlinear Pde, Jea Hyun Park
Doctoral Dissertations
We develop a theoretical foundation for the application of Nesterov’s accelerated gradient descent method (AGD) to the approximation of solutions of a wide class of partial differential equations (PDEs). This is achieved by proving the existence of an invariant set and exponential convergence rates when its preconditioned version (PAGD) is applied to minimize locally Lipschitz smooth, strongly convex objective functionals. We introduce a second-order ordinary differential equation (ODE) with a preconditioner built-in and show that PAGD is an explicit time-discretization of this ODE, which requires a natural time step restriction for energy stability. At the continuous time level, we show …
Application Of Randomness In Finance, Jose Sanchez, Daanial Ahmad, Satyanand Singh
Application Of Randomness In Finance, Jose Sanchez, Daanial Ahmad, Satyanand Singh
Publications and Research
Brownian Motion which is also considered to be a Wiener process and can be thought of as a random walk. In our project we had briefly discussed the fluctuations of financial indices and related it to Brownian Motion and the modeling of Stock prices.
Zeta Function Regularization And Its Relationship To Number Theory, Stephen Wang
Zeta Function Regularization And Its Relationship To Number Theory, Stephen Wang
Electronic Theses and Dissertations
While the "path integral" formulation of quantum mechanics is both highly intuitive and far reaching, the path integrals themselves often fail to converge in the usual sense. Richard Feynman developed regularization as a solution, such that regularized path integrals could be calculated and analyzed within a strictly physics context. Over the past 50 years, mathematicians and physicists have retroactively introduced schemes for achieving mathematical rigor in the study and application of regularized path integrals. One such scheme was introduced in 2007 by the mathematicians Klaus Kirsten and Paul Loya. In this thesis, we reproduce the Kirsten and Loya approach to …
Obstructive Wiring Patterns To Circular Planarity In Electrical Networks, Hannah Lebo
Obstructive Wiring Patterns To Circular Planarity In Electrical Networks, Hannah Lebo
Williams Honors College, Honors Research Projects
In order for an electrical network to be printed on a flat surface without changing the network’s input or output, it is important to consider if any wires will cross and if this problem can be avoided. If a circular network can be printed so that no wires cross, the network is said to be circular planar. In this paper, we identify a number of wiring patterns that make circular planarity impossible. We find exactly 3 wiring patterns using circular pairs with sets of two nodes, and we find exactly 78 wiring patterns using circular pairs with sets of three …