On classification of polarized varieties with non-integral nef values

Let be an -dimensional normal projective variety with only Gorenstein, terminal, -factorial singularities. Let be an ample line bundle on . Let denote the nef value of . The classification of via the nef value morphism is given for the situations when satisfies or .

     

Global Convergence of Conjugate Gradient Methods without Line Search

Global convergence results are derived for well-known conjugate gradient methods in which the line search step is replaced by a step whose length is determined by a formula. The results include the following cases: (1) The Fletcher–Reeves method, the Hestenes–Stiefel method, and the Dai–Yuan method applied to a strongly convex LC ¹ objective function; (2) The Polak–Ribière method and the Conjugate Descent method applied to a general, not necessarily convex, LC ¹ objective function.     

在放宽的强Wolfe搜索下一般三项共轭梯度法的全局收敛性

Abstract. The global convergence of the general three-term conjugate gradient methods withthe relaxed strong Wolfe line-search is proved.     

A three-parameter family of nonlinear conjugate gradient methods

In this paper, we propose a three-parameter family of conjugate gradient methods for unconstrained optimization. The three-parameter family of methods not only includes the already existing six practical nonlinear conjugate gradient methods, but subsumes some other families of nonlinear conjugate gradient methods as its subfamilies. With Powell's restart criterion, the three-parameter family of methods with the strong Wolfe line search is shown to ensure the descent property of each search direction. Some general convergence results are also established for the three-parameter family of methods. This paper can also be regarded as a brief review on nonlinear conjugate gradient methods.

     

GO-spaces with -closed discrete dense subsets

In this paper we study the question ``When does a perfect generalized ordered space have a -closed-discrete dense subset?' and we characterize such spaces in terms of their subspace structure, -mappings to metric spaces, and special open covers. We also give a metrization theorem for generalized ordered spaces that have a -closed-discrete dense set and a weak monotone ortho-base. That metrization theorem cannot be proved in ZFC for perfect GO-spaces because if there is a Souslin line, then there is a non-metrizable, perfect, linearly ordered topological space that has a weak monotone ortho-base.

     

不等式约束最优化的一个使用非单调搜索的可行算法

对不等式约束最优化问题本文提出了一个新算法。算法使用了非单调搜索,它不仅放松了每步迭代中对搜索的限制,而且使得算法迭代到一定阶段后具有非常简洁的形式,在不需要严格互补条件的较弱假设下,算法是整体和超线性收敛的。     

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

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

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.