Statistics, Optimization and Information Computing 

About: Statistics, Optimization and Information Computing is an academic journal published by International Academic Press. The journal publishes majorly in the area(s): Mathematics & Estimator. It has an ISSN identifier of 2310-5070. Over the lifetime, 409 publications have been published receiving 1813 citations. The journal is also known as: Statistics, optimization and information computing & SOIC.

Random walks and market efficiency in chinese and indian equity markets

Abstract: Hypothesis of Market Efficiency is an important concept for the investors across the globe holding diversified portfolios. With the world economy getting more integrated day by day, more people are investing in global emerging markets. This means that it is pertinent to understand the efficiency of these markets. This paper tests for market efficiency by studying the impact of global financial crisis of 2008 and the recent Chinese crisis of 2015 on stock market efficiency in emerging stock markets of China and India. The data for last 20 years was collected from both Bombay Stock Exchange (BSE200) and the Shanghai Stock Exchange Composite Index and divided into four sub-periods, i.e. before financial crisis period (period-I), during recession (period-II), after recession and before Chinese Crisis (periodIII) and from the start of Chinese crisis till date (period- IV). Daily returns for the SSE and BSE were examined and tested for randomness using a combination of auto correlation tests, runs tests and unit root tests (Augmented Dickey-Fuller) for the entire sample period and the four sub-periods. The evidence from all these tests supports that both the Indian and Chinese stock markets do not exhibit weak form of market efficiency. They do not follow random walk overall and in the first three periods (1996 till the 2015) implying that recession did not impact the markets to a great extent, although the efficiency in percentage terms seems to be increasing after the global financial crisis of 2008.

Minimax-robust estimation problems for stationary stochastic sequences

Abstract: This survey provides an overview of optimal estimation of linear functionals which depend on the unknown values of a stationary stochastic sequence. Based on observations of the sequence without noise as well as observations of the sequence with a stationary noise, estimates could be obtained. Formulas for calculating the spectral characteristics and the mean-square errors of the optimal estimates of functionals are derived in the case of spectral certainty, where spectral densities of the sequences are exactly known. In the case of spectral uncertainty, where spectral densities of the sequences are not known exactly while sets of admissible spectral densities are given, the minimax-robust method of estimation is applied. Formulas that determine the least favourable spectral densities and the minimax spectral characteristics of estimates are presented for some special classes of admissible spectral densities.

Parameter Estimation, Sensitivity Analysis and Optimal Control of a Periodic Epidemic Model with Application to HRSV in Florida

Abstract: A state wide Human Respiratory Syncytial Virus (HRSV) surveillance system was implemented in Florida in 1999 to support clinical decision-making for prophylaxis of premature infants. The research presented in this paper addresses the problem of fitting real data collected by the Florida HRSV surveillance system by using a periodic SEIRS mathematical model. A sensitivity and cost-effectiveness analysis of the model is done and an optimal control problem is formulated and solved with treatment as the control variable.

Calculus of variations involving Caputo-Fabrizio fractional differentiation

Abstract: This paper is devoted to study some variational problems with functionals containing the Caputo-Fabrizio fractional derivative, that is a fractional derivative with a non-singular kernel.

A note on the inertial proximal point method

Abstract: The proximal point method (PPM) for solving maximal monotone operator inclusion problem is a highly powerful tool for algorithm design, analysis and interpretation. To accelerate convergence of the PPM, inertial PPM (iPPM) was proposed in the literature. In this note, we point out that some of the attractive properties of the PPM, e.g., the generated sequence is contractive with the set of solutions, do not hold anymore for iPPM. To partially inherit the advantages of the PPM and meanwhile incorporate inertial extrapolation steps, we propose an iPPM with alternating inertial steps. Our analyses show that the even subsequence generated by the proposed iPPM is contractive with the set of solutions. Moreover, we establish global convergence result under much relaxed conditions on the inertial extrapolation stepsizes, e.g., monotonicity is no longer needed and the stepsizes are significantly enlarged compared to existing methods. Furthermore, we establish certain $o(1/k)$ convergence rate results, where $k$ denotes the iteration counter. These features are new to inertial type PPMs.