动态规划：最长单调递增子序列 A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For examp
改进的求解伪单调变分不等式的自适应算法，余增，，In this paper, a self-adaptive projection method with a new search direction for solving pseudomonotone variational inequality (VI) problems is proposed, which can be viewed as an
