Statistics, Optimization & Information Computing
http://iapress.org/index.php/soic
<p><em><strong>Statistics, Optimization and Information Computing</strong></em> (SOIC) is an international refereed journal dedicated to the latest advancement of statistics, optimization and applications in information sciences. Topics of interest are (but not limited to): </p> <p>Statistical theory and applications</p> <ul> <li class="show">Statistical computing, Simulation and Monte Carlo methods, Bootstrap, Resampling methods, Spatial Statistics, Survival Analysis, Nonparametric and semiparametric methods, Asymptotics, Bayesian inference and Bayesian optimization</li> <li class="show">Stochastic processes, Probability, Statistics and applications</li> <li class="show">Statistical methods and modeling in life sciences including biomedical sciences, environmental sciences and agriculture</li> <li class="show">Decision Theory, Time series analysis, High-dimensional multivariate integrals, statistical analysis in market, business, finance, insurance, economic and social science, etc</li> </ul> <p> Optimization methods and applications</p> <ul> <li class="show">Linear and nonlinear optimization</li> <li class="show">Stochastic optimization, Statistical optimization and Markov-chain etc.</li> <li class="show">Game theory, Network optimization and combinatorial optimization</li> <li class="show">Variational analysis, Convex optimization and nonsmooth optimization</li> <li class="show">Global optimization and semidefinite programming </li> <li class="show">Complementarity problems and variational inequalities</li> <li class="show"><span lang="EN-US">Optimal control: theory and applications</span></li> <li class="show">Operations research, Optimization and applications in management science and engineering</li> </ul> <p>Information computing and machine intelligence</p> <ul> <li class="show">Machine learning, Statistical learning, Deep learning</li> <li class="show">Artificial intelligence, Intelligence computation, Intelligent control and optimization</li> <li class="show">Data mining, Data analysis, Cluster computing, Classification</li> <li class="show">Pattern recognition, Computer vision</li> <li class="show">Compressive sensing and sparse reconstruction</li> <li class="show">Signal and image processing, Medical imaging and analysis, Inverse problem and imaging sciences</li> <li class="show">Genetic algorithm, Natural language processing, Expert systems, Robotics, Information retrieval and computing</li> <li class="show">Numerical analysis and algorithms with applications in computer science and engineering</li> </ul>en-US<span>Authors who publish with this journal agree to the following terms:</span><br /><br /><ol type="a"><ol type="a"><li>Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a <a href="http://creativecommons.org/licenses/by/3.0/" target="_new">Creative Commons Attribution License</a> that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.</li><li>Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.</li><li>Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See <a href="http://opcit.eprints.org/oacitation-biblio.html" target="_new">The Effect of Open Access</a>).</li></ol></ol>david.iapress@gmail.com (David G. Yu)nhma0004@gmail.com (IAPress technical support)Thu, 06 Aug 2020 23:32:32 +0800OJS 3.1.2.1http://blogs.law.harvard.edu/tech/rss60Convergence Analysis of a Stochastic Progressive Hedging Algorithm for Stochastic Programming
http://iapress.org/index.php/soic/article/view/964
<p>Stochastic programming is an approach for solving optimization problems with uncertainty data whose probability distribution is assumed to be known, and progressive hedging algorithm (PHA) is a well-known decomposition method for solving the underlying model. However, the per iteration computation of PHA could be very costly since it solves a large number of subproblems corresponding to all the scenarios. In this paper, a stochastic variant of PHA is studied. At each iteration, only a small fraction of the scenarios are selected uniformly at random and the corresponding variable components are updated accordingly, while the variable components corresponding to those not selected scenarios are kept untouch. Therefore, the per iteration cost can be controlled freely to achieve very fast iterations. We show that, though the per iteration cost is reduced significantly, the proposed stochastic PHA converges in an ergodic sense at the same sublinear rate as the original PHA.</p>Zhenguo Mu, Junfeng Yang
Copyright (c) 2020 Statistics, Optimization & Information Computing
http://iapress.org/index.php/soic/article/view/964Thu, 06 Aug 2020 23:12:33 +0800CQ-free optimality conditions and strong dual formulations for a special conic optimization problem
http://iapress.org/index.php/soic/article/view/915
<p>In this paper, we consider a special class of conic optimization problems, consisting of set-semidefinite<br>(or K-semidefinite) programming problems, where the set K is a polyhedral convex cone.</p> <p>For these problems, we introduce the concept of immobile indices and study the properties of the set of normalized immobile indices and the feasible set. This study provides the main result of the paper, which is to formulate and prove the new first-order optimality conditions in the form of a criterion. The optimality conditions are explicit and do not use any constraint qualifications. For the case of a linear cost function, we reformulate the K-semidefinite problem in a regularized form and construct its dual. We show that the pair of the primal and dual regularized problems satisfies the strong duality relation which means that the duality gap is vanishing.</p>Olga Kostyukova, Tatiana V. Tchemisova
Copyright (c) 2020 Statistics, Optimization & Information Computing
http://iapress.org/index.php/soic/article/view/915Fri, 19 Jun 2020 00:00:00 +0800Minimax-robust forecasting of sequences with periodically stationary long memory multiple seasonal increments
http://iapress.org/index.php/soic/article/view/998
<p>We introduce a stochastic sequence $\zeta(k)$ with periodically stationary generalized multiple increments of fractional order which combines cyclostationary, multi-seasonal, integrated and fractionally integrated patterns. We solve the problem of optimal estimation of linear functionals constructed from unobserved values of the stochastic sequence $\zeta(k)$ based on its observations at points $ k<0$. For sequences with known matrices of spectral densities, we obtain formulas for calculating values of the mean square errors and the spectral characteristics of the optimal estimates of the functionals. Formulas that determine the least favorable spectral densities and minimax (robust) spectral characteristics of the optimal linear estimates of the functionals are proposed in the case where spectral densities of the sequence are not exactly known while some sets of admissible spectral densities are given.</p>Maksym Luz; Mikhail Moklyachuk
Copyright (c) 2020 Statistics, Optimization & Information Computing
http://iapress.org/index.php/soic/article/view/998Sat, 25 Jul 2020 00:00:00 +0800Sample Paths Properties of Stochastic Processes from Orlicz Spaces, with Applications to Partial Differential Equations
http://iapress.org/index.php/soic/article/view/880
<p>In the present paper we obtain conditions for stochastic processes from Orlicz spaces to have almost sure bounded and continuous sample paths, the study is concerned with the processes defined on unbounded domains. Estimates for the distributions of suprema of the processes are also presented. Conditions are given in terms of entropy integrals and majorant characteristics of Orlicz spaces. Possible applications to solutions of partial differential equations are discussed. Examples of processes are given for which conditions of the main results are satisfied.</p>Lyudmyla Sakhno, Yuriy Kozachenko, Enzo Orsingher, Olha Hopkalo
Copyright (c) 2020 Statistics, Optimization & Information Computing
http://iapress.org/index.php/soic/article/view/880Sat, 25 Jul 2020 00:00:00 +0800A Note on CCMV Portfolio Optimization Model with Short Selling and Risk-neutral Interest Rate
http://iapress.org/index.php/soic/article/view/890
<p>In this paper, first we present some drawbacks of the cardinality constrained mean-variance (CCMV) portfolio optimization with short selling and risk-neutral interest rate when the lower and upper bounds of the assets contributions are -1/K and 1/K(K denotes the number of assets in portfolio). Then, we present an improved variant using absolute returns instead of the returns to include short selling in the model. Finally, some numerical results are provided using the data set of the S&P 500 index, Information Technology, and the MIBTEL index in terms of returns and Sharpe ratios to compare the proposed models with those in the literature.</p>Tahereh Khodamoradi, Maziar Salahi, Ali Reza Najafi
Copyright (c) 2020 Statistics, Optimization & Information Computing
http://iapress.org/index.php/soic/article/view/890Sun, 14 Jun 2020 00:00:00 +0800Volatility Modelling of the BRICS Stock Markets
http://iapress.org/index.php/soic/article/view/977
<p>Volatility modelling is a key factor in equity markets for risk and portfolio management. This paper focuses on the use of a univariate generalized autoregressive conditional heteroscedasticity (GARCH) models for modelling volatility of the BRICS (Brazil, Russia, India, China and South Africa) stock markets. The study was conducted under the assumptions of seven error distributions that include the normal, skewed-normal, Student’s t, skewed-Student’s t, generalized error distribution (GED), skewed-GED and the generalized hyperbolic (GHYP) distribution. It was observed that using an ARMA(1, 1)-GARCH(1, 1) model, volatilities of the Brazilian Bovespa and the Russian IMOEX markets can both be well characterized (or described) by a heavy-tailed Student’s t distribution, while the Indian NIFTY market’s volatility is best characterized by the generalized hyperbolic (GHYP) distribution. Also, the Chinese SHCOMP and South African JALSH markets’ volatilities are best described by the skew-GED and skew-Student’s t distribution, respectively. The study further observed that the persistence of volatility in the BRICS markets does not follow the same hierarchical pattern under the error distributions, except under the skew-Student’s t and GHYP distributions where the pattern is the same. Under these two assumptions, i.e. the skew-Student’s t and GHYP, in a descending hierarchical order of magnitudes, volatility with persistence is highest in the Chinese market, followed by the South African market, then the Russian, Indian and Brazilian markets, respectively. However, under each of the five non-Gaussian error distributions, the Chinese market is the most volatile, while the least volatile is the Brazilian market.</p>Rosinah M Mukhodobwane, Caston Sigauke, Wilbert Chagwiza, Winston Garira
Copyright (c) 2020 Statistics, Optimization & Information Computing
http://iapress.org/index.php/soic/article/view/977Sat, 25 Jul 2020 00:00:00 +0800Overdisp: A Stata (and Mata) Package for Direct Detection of Overdispersion in Poisson and Negative Binomial Regression Models
http://iapress.org/index.php/soic/article/view/557
<p>Stata has several procedures that can be used in analyzing count-data regression models and, more specifically, in studying the behavior of the dependent variable, conditional on explanatory variables. Identifying overdispersion in countdata models is one of the most important procedures that allow researchers to correctly choose estimations such as Poisson or negative binomial, given the distribution of the dependent variable. The main purpose of this paper is to present a new command for the identification of overdispersion in the data as an alternative to the procedure presented by Cameron and Trivedi [5], since it directly identifies overdispersion in the data, without the need to previously estimate a specific type of count-data model. When estimating Poisson or negative binomial regression models in which the dependent variable is quantitative, with discrete and non-negative values, the new Stata package overdisp helps researchers to directly propose more consistent and adequate models. As a second contribution, we also present a simulation to show the consistency of the overdispersion test using the overdisp command. Findings show that, if the test indicates equidispersion in the data, there are consistent evidence that the distribution of the dependent variable is, in fact, Poisson. If, on the other hand, the test indicates overdispersion in the data, researchers should investigate more deeply whether the dependent variable actually exhibits better adherence to the Poisson-Gamma distribution or not.</p>Luiz Paulo Lopes Fávero, Patrícia Belfiore, Marco Aurélio dos Santos, R. Freitas Souza
Copyright (c) 2020 Statistics, Optimization & Information Computing
http://iapress.org/index.php/soic/article/view/557Sun, 14 Jun 2020 00:00:00 +0800Tail distribution of the integrated Jacobi diffusion process
http://iapress.org/index.php/soic/article/view/760
<p>In this paper, we study the distribution of the integrated Jacobi diffusion processes with Brownian noise and fractional Brownian noise. Based on techniques of Malliavin calculus, we develop a unified method to obtain explicit estimates for the tail distribution of these integrated diffusions.</p>Nguyen Tien Dung , Trinh Nhu Quynh
Copyright (c) 2020 Statistics, Optimization & Information Computing
http://iapress.org/index.php/soic/article/view/760Wed, 01 Jul 2020 00:00:00 +0800