三维荧光光谱的特征区域选择方法

将数学中的二元凸函数判定和数据挖掘中的聚类分析方法结合,提出了针对三维荧光的光谱区域选择方法,并利用此种方法从光谱图中提取出含有丰富光谱信息的凸集区域。对水体中总有机碳的检测和白酒中黄曲霉素的检测进行了实验研究,实验结果表明,采用本文提出的三维荧光光谱区域选择方法提高了模型的精度,与利用全光谱所建立的回归模型相比,模型精度分别提高了6.17%和4.97%。     

OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS

Abstract

New insights are presented from a convex duality classification theory of over 25 years ago for recent computational complexity results developed for recognizing some of the asymptotic duality states that prevail for an arbitrary convex programming pair.     

Hybrid projection method for generalized mixed equilibrium problem and fixed point problem of infinite family of asymptotically quasi-?-nonexpansive mappings in Banach spaces

In this paper, we consider a hybrid projection method for finding a common element in the set of fixed points of a infinite family of asymptotically quasi-?-nonexpansive mappings and in the set of solutions of a generalized mixed equilibrium problem. Some strong convergence theorems of common elements are established in a uniformly smooth and strictly convex Banach space which has the Kadec-Klee property. The results presented in the paper improve and extend some recent results.     

广义黏性逼近方法及其应用

黏性逼近方法在非扩张映射不动点问题的研究中扮演着重要的角色。提出了一类广义黏性逼近方法，在一定条件下，证明了该算法的收敛性.作为应用，将所得的收敛性结果应用于求解约束凸优化问题与双层优化问题。     

生态平衡制约下离散尺度结构种群的最优收获

研究基于扩展Leslie投影矩阵的离散尺度结构种群模型的最优收获问题,约束条件包括生态平衡和开发成本等.运用凸优化理论证明了最优收获策略的存在性,导出了最优收获模式,应用模型参数给出了收获比率.结论显示:最优策略具有两阶段结构.     

Asymptotic synchronization of continuous/discrete complex dynamical networks by optimal partitioning method

The synchronization problem for both continuous and discrete‐time complex dynamical networks with time‐varying delays is investigated. Using optimal partitioning method, time‐varying delays are partitioned into l subintervals and generalized results are derived in terms of linear matrix inequalities (LMIs). New delay‐dependent synchronization criteria in terms of LMIs are derived by constructing appropriate Lyapunov–Krasovskii functional, reciprocally convex combination technique and some inequality techniques. Numerical examples are given to illustrate the effectiveness and advantage of the proposed synchronization criteria. © 2014 Wiley Periodicals, Inc. Complexity 21: 193–210, 2015     

Accelerated Landweber iteration with convex penalty for linear inverse problems in Banach spaces

In recent years, Landweber iteration has been extended to solve linear inverse problems in Banach spaces by incorporating non-smooth convex penalty functionals to capture features of solutions. This method is known to be slowly convergent. However, because it is simple to implement, it still receives a lot of attention. By making use of the subspace optimization technique, we propose an accelerated version of Landweber iteration with non-smooth convex penalty which significantly speeds up the method. Numerical simulations are given to test the efficiency.