An Adaptive Nonmonotone Projected Barzilai-Borwein Gradient Method with Active Set Prediction for Nonnegative Matrix Factorization

In this paper, we first present an adaptive nonmonotone term to improve the efficiency of nonmonotone line search, and then an active set identification technique is suggested to get more efficient descent direction such that it improves the local convergence behavior of algorithm and decreases the computation cost. By means of the adaptive nonmonotone line search and the active set identification technique, we put forward a global convergent gradient-based method to solve the nonnegative matrix factorization (NMF) based on the alternating nonnegative least squares framework, in which we introduce a modified Barzilai-Borwein (BB) step size. The new modified BB step size and the larger step size strategy are exploited to accelerate convergence. Finally, the results of extensive numerical experiments using both synthetic and image datasets show that our proposed method is efficient in terms of computational speed.     

Efficient Laguerre and Hermite Spectral Methods for Odd-Order Differential Equations in Unbounded Domains

Laguerre dual-Petrov-Galerkin spectral methods and Hermite Galerkin spectral methods for solving odd-order differential equations in unbounded domains are proposed. Some Sobolev bi-orthogonal basis functions are constructed which lead to the diagonalization of discrete systems. Numerical results demonstrate the effectiveness of the suggested approaches.     

求解低秩矩阵填充的改进的交替最速下降法

矩阵填充是指利用矩阵的低秩特性而由部分观测元素恢复出原矩阵,在推荐系统、信号处理、医学成像、机器学习等领域有着广泛的应用。采用精确线搜索的交替最速下降法由于每次迭代计算量小因而对大规模问题的求解非常有效。本文在其基础上采用分离地精确线搜索,可使得每次迭代下降更多但计算量相同,从而可望进一步提高计算效率。本文分析了新算法的收敛性。数值结果也表明所提出的算法更加有效。     

球面稳定同伦群中非平凡元素γ_sξ_n

当p≥5, n≥0时,(i_1i_0)_*(h_n)∈Ext_■~(1,p~nq)(H~*K,Z_p)在Adams谱序列中是永久循环,并且收敛到π_(p~nq-1)K中的非零元.本文在此基础上,考虑了涉及第三希腊字母类乘积元素的收敛性,并且扩大了球面稳定同伦群中非平凡元素滤子s+1的取值范围,即当p+1 s+1 2p时,■_sh_n∈Ext_■~(s+1,t)(Z_p,Z_p)在Adams谱序列中是永久循环,并且收敛到π_(t-s-1)S中的非零元γ_sξ_n,其中p≥7, n≥3, t=p~nq+sp~2q+(s-1)pq+(s-2)q+s-3,q=2(p-1).     

On the Global Convergence of a Projective Trust Region Algorithm for Nonlinear Equality Constrained Optimization

A trust-region sequential quadratic programming (SQP) method is developed and analyzed for the solution of smooth equality constrained optimization problems. The trust-region SQP algorithm is based on filter line search technique and a composite-step approach, which decomposes the overall step as sum of a vertical step and a horizontal step. The algorithm includes critical modifications of horizontal step computation. One orthogonal projective matrix of the Jacobian of constraint functions is employed in trust-region subproblems. The orthogonal projection gives the null space of the transposition of the Jacobian of the constraint function. Theoretical analysis shows that the new algorithm retains the global convergence to the first-order critical points under rather general conditions. The preliminary numerical results are reported.     

A branch-and-bound algorithm to minimize the line length of a two-sided assembly line

A new branch-and-bound algorithm is presented to solve the two-sided assembly line balancing problem of type 1 (TALB-1). First, a pair of two directly facing station is defined as a position, and then the two-sided assembly line (TAL) is relaxed to a one-sided assembly line (OAL). Some new lower bound on positions are computed, and dominance rules and reduction rules for the one-sided assembly line balancing problem of type 1 (OALB-1) are extended and incorporated into a station-oriented assignment procedure for the TALB-1 problem. Finally, the tests are carried out on a well-known benchmark set of problem instances, and experimental results demonstrate that the proposed procedure is efficient.     

The implications of costs, capacity, and competition on product line selection

We consider a situation in which a manufacturer has to select the product(s) to sell as well as the selling price and production quantity of each selected product. There are two substitutable products in the consideration set, where product 2 has a higher quality and reservation price than that of product 1. By considering the cannibalization effect that depends on the selling price of each product, the manufacturer needs to evaluate the profit function associated with three different product line options: sell both products or only one of the 2 products. In order to examine the impact of costs, capacity, and competition on the optimal product line selection, optimal price, and optimal production quantity analytically, we present a stylized model in this paper so that we can determine the conditions under which a particular option is optimal.     

双圈图按谱半径的排序

一个n阶简单连通图G被称为双圈图,如果它的边数是n+1.记B(n)是n阶双圈图的全体.本文确定了B(n)(n≥20)中谱半径的第六大至第十大值和对应的图.     

超线性奇异Neumann边值问题的非平凡解

利用拓扑度计算,研究了一类超线性奇异Neumann边值问题非平凡解的存在性,其中非线性项可变号且下方无界.     

一种修正的HS共轭梯度法及全局收敛性

<正>1引言考虑无约束极小化问题:(?),(1)其中f(x)连续可微,其梯度函数用g(x)表示.共轭梯度法求解(1)的常用迭代格式为:x_(k+1)=x_k+α_kd_k,(2)(?)(3)其中g_k=▽f(x_k),α_k≥0是由某种线搜索得到的步长因子;d_k为搜索方向,β_k为标量,β_k的不同选择产生了不同的共轭梯度法.著名的β_k公式有: