Numerical Algebra, Control and Optimization
September 2018 , Volume 8 , Issue 3
Select all articles
In the paper, we study a class of three-dimensional quasilinear hyperbolic systems. For such system, we set the initial boundary value problem and construct the energy integral. We construct the difference scheme and obtain an a priori estimate for its solution.
Power barrier options are options where the payoff depends on an underlying asset raised to a constant number. The barrier determines whether the option is knocked in or knocked out of existence when the underlying asset hits the prescribed barrier level, or not. This paper derives the analytical solution of the power options with an exponentially curved barrier by utilizing the reflection principle and the change of measure. Numerical results show that prices of power options with exponentially curved barrier are cheaper than those of power barrier options and power options.
Optimal control can be helpful to test and compare different vaccination strategies of a certain disease. This study investigates a mathematical model of HIV infections in terms of a system of nonlinear ordinary differential equations (ODEs) which describes the interactions between the human immune systems and the HIV virus. We introduce chemotherapy in an early treatment setting through a dynamic treatment and then solve for an optimal chemotherapy strategy. The aim is to obtain a new optimal chemotherapeutic strategy where an isoperimetric constraint on the chemotherapy supply plays a crucial role. We outline the steps in formulating an optimal control problem, derive optimality conditions and demonstrate numerical results of an optimal control for the model. Numerical results illustrate how such a constraint alters the optimal vaccination schedule and its effect on cell-virus interactions.
Lagrange multipliers are usually used in numerical methods to solve equality constrained optimization problems. However, when the intersection between a search region for a current point and the feasible set defined by the equality constraints is empty, Lagrange multipliers cannot be used without additional conditions. To cope with this condition, a new method based on a two-phase approximate greatest descent approach is presented in this paper. In Phase-Ⅰ, an accessory function is used to drive a point towards the feasible set and the optimal point of an objective function. It has been observed that for some current points, it may be necessary to maximize the objective function while minimizing the constraint violation function in a current search region in order to construct the best numerical iterations. When the current point is close to or inside the feasible set and when optimality conditions are nearly satisfied, the numerical iterations are switched to Phase-Ⅱ. The Lagrange multipliers are defined and used in this phase. The approximate greatest descent method is then applied to minimize a merit function which is constructed from the optimality conditions. Results of numerical experiments are presented to show the effectiveness of the aforementioned two-phase method.
Numerical optimization is required in artificial neural network to update weights iteratively for learning capability. In this paper, we propose the use of Approximate Greatest Descent (AGD) algorithm to optimize neural network weights using long-term backpropagation manner. The modification and development of AGD into stochastic diagonal AGD (SDAGD) algorithm could improve the learning ability and structural simplicity for deep learning neural networks. It is derived from the operation of a multi-stage decision control system which consists of two phases: (1) when local search region does not contain the minimum point, iteration shall be defined at the boundary of the local search region, (2) when local region contains the minimum point, Newton method is approximated for faster convergence. The integration of SDAGD into Multilayered perceptron (MLP) network is investigated with the goal of improving the learning ability and structural simplicity. Simulation results showed that two-layer MLP with SDAGD achieved a misclassification rate of 9.4% on a smaller mixed national institute of national and technology (MNIST) dataset. MNIST is a database equipped with handwritten digits images suitable for algorithm prototyping in artificial neural networks.
TIn this note, we review homotopy perturbation method (HPM), Discrete HPM, Chebyshev polynomials and its properties. Moreover, the convergences of HPM and error term of Chebyshev polynomials were discussed. Then, linear singular integral equations (SIEs) and hyper-singular integral equations (HSIEs) are solved by combining modified HPM together with Chebyshev polynomials. Convergences of the mixed method for the linear HSIEs are also obtained. Finally, illustrative examples and comparisons with different methods are presented.
The urban transit routing problem (UTRP) deals with public transport systems in determining a set of efficient transit routes on existing road networks to meet transit demands. The UTRP is a complex combinatorial optimization problem characterized with a large search space, multi-constraint, and multiobjective nature where the likelihood of generating infeasible route sets is high. In this paper, an improved sub-route reversal repair mechanism is proposed to deal with the infeasibility. A population-based metaheuristic, namely, Differential Evolution (DE) algorithm is then proposed to handle the multiobjective UTRP with the aim of devising an efficient transit route network that optimizes both passengers' and operators' costs. Computational experiments are performed on well-known benchmark instances to evaluate the effectiveness of the proposed repair mechanism and the DE algorithm. The computational results are reported to have better parameter values in most cases when compared to other approaches in the literature.
In this paper, we aim to propose some spectral gradient methods via variational technique under log-determinant norm. The spectral parameters satisfy the modified weak secant relations that inspired by the multistep approximation for solving large scale unconstrained optimization. An executable code is developed to test the efficiency of the proposed method with spectral gradient method using standard weak secant relation as constraint. Numerical results are presented which suggest a better performance has been achieved.
Add your name and e-mail address to receive news of forthcoming issues of this journal:
[Back to Top]