- Advances in Mathematics of Communications
- Big Data & Information Analytics
- Communications on Pure & Applied Analysis
- Discrete & Continuous Dynamical Systems - A
- Discrete & Continuous Dynamical Systems - B
- Discrete & Continuous Dynamical Systems - S
- Evolution Equations & Control Theory
- Foundations of Data Science
- Inverse Problems & Imaging
- Journal of Computational Dynamics
- Journal of Dynamics & Games
- Journal of Geometric Mechanics
- Journal of Industrial & Management Optimization
- Journal of Modern Dynamics
- Kinetic & Related Models
- Mathematical Biosciences & Engineering
- Mathematical Control & Related Fields
- Mathematical Foundations of Computing
- Networks & Heterogeneous Media
- Numerical Algebra, Control & Optimization
- AIMS Mathematics
- Conference Publications
- Electronic Research Announcements
- Mathematics in Engineering
Open Access Journals
The classical multifacility Weber problem (MFWP) is one of the most important models in facility location. This paper considers more general and practical case of MFWP called constrained multifacility Weber problem (CMFWP), in which the gauge is used to measure distances and locational constraints are imposed to facilities. In particular, we develop a variational inequality approach for solving it. The CMFWP is reformulated into a linear variational inequality, whose special structures lead to new projection-type methods. Global convergence of the projection-type methods is proved under mild assumptions. Some preliminary numerical results are reported which verify the effectiveness of proposed methods.
Portfolio selection is widely recognized as the birth-place of modern finance; portfolio optimization has become a developed tool for portfolio selection by the endeavor of generations of scholars. Multiple optima are an important aspect of optimization. Unfortunately, there is little research for multiple optima of portfolio optimization. We present examples for the multiple optima, emphasize the risk of overlooking the multiple optima by (ordinary) quadratic programming, and report the software failure by parametric quadratic programming. Moreover, we study multiple optima of multiple-objective portfolio selection and prove the nonexistence of the multiple optima of an extension of the model of Merton. This paper can be a step-stone of studying the multiple optima.
This paper is concerned with optimal boundary control of a three dimensional reaction-diffusion system in a more general form than what has been presented in the literature. The state equations are analyzed and the optimal control problem is investigated. Necessary and sufficient optimality conditions are derived. The model is widely applicable due to its generality. Some examples in applications are discussed.
We propose two new double projection algorithms for solving the split feasibility problem (SFP). Different from the extragradient projection algorithms, the proposed algorithms do not require fixed stepsize and do not employ the same projection region at different projection steps. We adopt flexible rules for selecting the stepsize and the projection region. The proposed algorithms are shown to be convergent under certain assumptions. Numerical experiments show that the proposed methods appear to be more efficient than the relaxed- CQ algorithm.
This paper considers the problem of temporary shortage of some resources within a project execution period. Mathematical models for two different cases of this problem are established. Semidefinite relaxation technique is applied to get immediate solvent of these models. Relationship between the models and their semidefinite relaxations is studied, and some numerical experiments are implemented, which show that these mathematical models are reasonable and feasible for practice, and semidefinite relaxation can efficiently solve the problem.
Year of publication
[Back to Top]