Loading...

Table of Content

    15 March 2024, Volume 28 Issue 1
    An accelerated method for solving a class of linear equality constrained convex optimization
    Xinqing MENG, Wenxing ZAHNG
    2024, 28(1):  1-17.  doi:10.15960/j.cnki.issn.1007-6093.2024.01.001
    Asbtract ( 57 )   HTML ( 3)   PDF (2761KB) ( 47 )  
    Figures and Tables | References | Related Articles | Metrics

    The linearly constrained convex optimization is a class of quintessential problem in optimization community. In this paper, we will devote to the algorithmic study of such problems on the perspective of duality. By introducing auxiliary variables, the dual of this problem can be reformulated into a separable structured optimization. By virtue of the recent advances in accelerated alternating direction method of multiplier, we analyze the convergence and establish the $O(1/k^2)$ convergence rate of Goldstein et al's accelerated algorithm under some mild conditions. Specifically, 1) the objective suffices to be convex instead of strongly convex; 2) the penalty parameter merely requires $\beta>0$ instead of a bounded interval involving Lipschitz constant and strongly convex modulus. Some numerical experiments on image reconstruction problem were conducted to demonstrate the performance of algorithm on solving linearly constrained convex optimization, which is computationally appealing.

    A mirror descent gradient ascent algorithm for one side relatively smooth nonconvex-concave minimax optimization problems
    Yang XU, Junlin WANG, Zi XU
    2024, 28(1):  18-28.  doi:10.15960/j.cnki.issn.1007-6093.2024.01.002
    Asbtract ( 40 )   HTML ( 3)   PDF (762KB) ( 25 )  
    References | Related Articles | Metrics

    In this paper, we propose a mirror descent gradient ascent algorithm to solve one side relatively smooth nonconvex-concave minimax optimization problems. At each iteration of the proposed algorithm, a mirror descent step is performed to update the relatively smooth variable, while a gradient ascent projection step is used to update the smooth variable alternately. We also prove that the iteration complexity of the proposed algorithm is $\mathcal{O}\left( \varepsilon ^{-4} \right)$ to achieve an $\varepsilon$-approximate first-order stationary point.

    Performance analysis of a fluid model driven by M/M/1 queue with $N$-policy and two-stage vacation
    Xun WANG, Xiuli XU
    2024, 28(1):  29-39.  doi:10.15960/j.cnki.issn.1007-6093.2024.01.003
    Asbtract ( 32 )   HTML ( 0)   PDF (796KB) ( 10 )  
    Figures and Tables | References | Related Articles | Metrics

    Based on the operation mechanism of the factory order assembly system, this paper constructed and analyzed a fluid model driven by the M/M/1 queue with two type of mixed vacations and $N$ policy. Firstly, the driving system is described and the infinite small generators of the Markov process are decomposed into a blocky Jacobian matrix form. Then the three-dimensional Markov process of the fluid queue is established, the differential equations satisfied by the stationary joint distribution are obtained, and the mathematical expression of the stationary buffer content is deduced using matrix geometric solution and Laplace transformation. Then the expected buffer content is derived by Laplace-Stieltjes transformation. Finally, the influence of parameters changing on the performance indicators is illustrated by numerical analysis.

    Queueing-inventory system with multiple synchronous vacations of partial servers
    Ziqin YE, Dequan YUE
    2024, 28(1):  40-56.  doi:10.15960/j.cnki.issn.1007-6093.2024.01.004
    Asbtract ( 21 )   HTML ( 1)   PDF (841KB) ( 11 )  
    Figures and Tables | References | Related Articles | Metrics

    In this paper, we consider a Markovian $\left({s, S}\right)$ queueing-inventory system in which only partial servers take multiple synchronous vacations when the on-hand inventory level is zero. It is assumed that the vacation time follows an exponential distribution. The customers arrive according to a Poisson process, and the service time of the customers is distributed exponentially. The lead times for the orders are assumed to have independent and identical exponential distributions. Using the theory of quasi-birth-and-death process, the matrix-geometric solution of the steady-state probability is derived. On this basis, the steady-state performance measures and cost function of the system are obtained. Finally, the effect of the parameters on cost function is analyzed by numerical examples, and the optimal inventory policy and the optimal expected cost are also computed.

    Research on emergency response and simulation of public health emergencies based on tripartite evolutionary game
    Xiaoling KE, Zhengjuan LIU, Haixiang GUO, Gaosheng CHEN, Moujun ZHENG
    2024, 28(1):  57-76.  doi:10.15960/j.cnki.issn.1007-6093.2024.01.005
    Asbtract ( 123 )   HTML ( 0)   PDF (1889KB) ( 8 )  
    Figures and Tables | References | Related Articles | Metrics

    The mutual cooperation and coordinated response of local governments, social organizations and the public in public health emergencies is an inevitable choice for timely and efficient emergency management. By taking the COVID-19 epidemic as the background, we consider the interaction and game relationship between multiple subjects in the emergency response process, and based on the assumption of bounded rationality, constructs a dynamic game model of the evolution of the three parties of the local government, social organizations and the public. Then, by using evolutionary game theory and Lyapunov discriminant method to analyze the equilibrium point and asymptotic stability of the tripartite evolution model, we obtain the evolutionary stable strategy of the tripartite subject under different conditions. Finally, the game behavior of the tripartite emergency response in different stages of public health emergencies is simulated and analyzed, and the influence of local government subsidy policies, reward and punishment measures, and social organization costs on the strategic choices of all parties in the game are discussed. The research results show that: (1) in different stages of emergency response to public health emergencies, the decision-making choices of each subject evolve dynamically; (2) local government subsidy policies, reward and punishment measures, and social organization costs have a significant effect on the subject's emergency response behavior; (3) the initial participation willingness of each subject has a significant impact on the emergency response to public health emergencies.

    The study of distributionally robust reward-risk optimization models with moment-based ambiguity set
    Yinghan LI, Xiaojiao TONG, Liu YANG
    2024, 28(1):  77-88.  doi:10.15960/j.cnki.issn.1007-6093.2024.01.006
    Asbtract ( 34 )   HTML ( 0)   PDF (797KB) ( 38 )  
    Figures and Tables | References | Related Articles | Metrics

    This article studies the reward-risk optimization model under the uncertain distribution of random variables. In view of the three typical problems of traditional reward-risk and the background of uncertainty of distributions, a new model of distributionally robust reward-risk optimization is proposed under more general conditions. Based on moment ambiguity set and optimal duality theory, the complex new optimization model is simplified to a nonlinear optimization problem of conventional structure. The equivalence of efficient frontier of three types of distributionally robust reward-risk optimization models is proved theoretically. Numerical example verifies the effectiveness of the theoretical analysis.

    An adaptive surrogate optimization method for expensive black-box problems with hidden constraints
    Fusheng BAI, Mi LAN
    2024, 28(1):  89-100.  doi:10.15960/j.cnki.issn.1007-6093.2024.01.007
    Asbtract ( 24 )   HTML ( 0)   PDF (874KB) ( 14 )  
    Figures and Tables | References | Related Articles | Metrics

    A surrogate optimization method with adaptive transition search strategy is proposed for expensive black-box problems with hidden constraints. In the sub-steps of the transition search, a variance related to the number of evaluated points is used for the generation of trial points by random perturbation to better balance the local and global searches. In order to better approximate the real black box objective function, an adaptively combined objective surrogate model is adopted. The effectiveness of the proposed algorithm is demonstrated by the results of the numerical experiments carried out on 50 test problems.

    A nonlinear bound strengthing method for the steady-state operation optimization model of gas pipeline networks
    Qing ZHANG, Liang CHEN, Wenbao AI, Caixia KOU
    2024, 28(1):  101-111.  doi:10.15960/j.cnki.issn.1007-6093.2024.01.008
    Asbtract ( 44 )   HTML ( 0)   PDF (873KB) ( 15 )  
    Figures and Tables | References | Related Articles | Metrics

    The gas pipeline network steady-state operation optimization problem plays an important role in improving energy use efficiency and reducing operation cost in many aspects. It is extremely challenging to solve its mixed integer nonlinear programming model, because of the complex network structure, large scale and high nonlinearity. In this paper, based on the bound strengthing method of mixed integer linear programming, we propose a nonlinear bound strengthing method for the structure of this problem, which can tighten the upper and lower bounds of variables and more approximate to the original mixed integer nonlinear programming model in the linearization method. Numerical results show that this method can obtain better feasible solutions and speed up the solution of the optimization problem for the steady-state operation of gas pipeline networks.

    The distance spectra of chain graphs
    Xuezheng LYU, Mengyu MA
    2024, 28(1):  112-120.  doi:10.15960/j.cnki.issn.1007-6093.2024.01.009
    Asbtract ( 25 )   HTML ( 0)   PDF (716KB) ( 11 )  
    Figures and Tables | References | Related Articles | Metrics

    A graph is called a chain graph if it does not contain induced $2K_2$, $C_3$ or $C_5$. In spectral graph theory, chain graphs feature as graphs whose largest eigenvalue within the connected bipartite graphs of fixed order and size is maximal. In this paper, we consider the distance eigenvalues of a connected chain graph $G$. We present that $-2$ is an eigenvalue of $G=G(t_1,\cdots,t_h; s_1,\cdots,s_h)$, with multiplicity $n-2h$. And further more, there are exactly $h-1$ eigenvalues less than -2 and exactly $h+1$ eigenvalues greater than -2.

    On the eigenvalues and eigenvectors of Aα in weighted non-regular graphs
    Changxiang HE, Wenyan WANG, Lele LIU
    2024, 28(1):  121-130.  doi:10.15960/j.cnki.issn.1007-6093.2024.01.010
    Asbtract ( 25 )   HTML ( 0)   PDF (710KB) ( 12 )  
    References | Related Articles | Metrics

    Let $G_\omega=(G, \omega)$ be a weighted graph, whose adjacency matrix and weighted degree diagnoal matrix are $A(G_\omega)$ and $D(G_\omega)$, respectively. For given $\alpha \in [0, 1]$, the matrix $A_\alpha(G_\omega)=\alpha D(G_\omega)+(1-\alpha)A(G_\omega)$ is the $A_\alpha$- matrix of $G_\omega$. In this paper, we give some bounds on the $A_\alpha$-eigenvalue of connected weighted non-regular graphs $G_\omega$, and obtain the lower bound of the ratio of the largest component to the smallest component in the eigenvector of the $A_\alpha$- spectral radius.

    Some new sufficient condition on traceable graphs
    Guidong YU, Zhenzhen LIU, Lixiang WANG, Qing LI
    2024, 28(1):  131-140.  doi:10.15960/j.cnki.issn.1007-6093.2024.01.011
    Asbtract ( 31 )   HTML ( 1)   PDF (756KB) ( 13 )  
    Figures and Tables | References | Related Articles | Metrics

    Let $G$ be a simple connected graph, $e(G)$, $\mu(G)$ and $q(G)$ be the edge number, the spectral radius and the signless Laplacian spectral radius of the graph $G$, respectively. If a graph has a path which contains all vertices of the graph, the path is called a Hamilton path, the graph is called traceable graph. In this paper, we present some new sufficient conditions for the graph to be traceable graph in terms of $e(G)$, $\mu(G)$ and $q(G)$, respectively. The results generalize the existing conclusions.

    The sharp bounds on general sum-connectivity index of graphs for operations based on strong product
    Zhihao LI, Yan ZHU
    2024, 28(1):  141-152.  doi:10.15960/j.cnki.issn.1007-6093.2024.01.012
    Asbtract ( 31 )   HTML ( 0)   PDF (742KB) ( 12 )  
    Figures and Tables | References | Related Articles | Metrics

    For a graph $G$, the edge set of graph $G$ denoted by $E(G)$, the vertex set of graph $G$ denoted by $V(G)$, let $d_G (v)$ denote the degree of $v$. For an edge $e=uv$, the general sum-connectivity index $\chi_\alpha(e)=(d_G(u)+d_G(v))^\alpha$, in which $\alpha$ is any real number. In current paper, we introduce firstly the four operations($S, R, Q, T$) of the graph, then give the strong product under the four operations, and determine the upper and lower bounds of the general sum-connectivity index of the four graphs by using the maximum and minimum degrees.

    Improved upper bound of feedback number for 2-dimensional meshes
    Xueli SU, Xiaohui LI, Yan LIU
    2024, 28(1):  153-158.  doi:10.15960/j.cnki.issn.1007-6093.2024.01.013
    Asbtract ( 29 )   HTML ( 0)   PDF (1373KB) ( 6 )  
    Figures and Tables | References | Related Articles | Metrics

    Let $G = (V, E)$ be a simple graph and $F$ be a subset of $V$. If the subgraph induced by the subset $V-F$ does not contain cycles, then $F$ is called a feedback set of $G$. The smallest value of the numbers of vertices in feedback sets is called the feedback number of $G$, denoted by $f(G)$, that is, $f(G)=\min\{|F| : F$ is a feedback set of $G\}$. Caragiannis et al. obtained the upper bounds of the feedback number of 2-dimensional meshes. In this paper, we improve the upper bounds.