本文提供了在没有非奇异假设的条件下，求解有界约束半光滑方程组的投影信赖域算法。
In this paper, we propose a projected trust-region algorithm for solving bound-constrained smooth systems of equations.
提出了求解一类带一般凸约束的复合非光滑优化的信赖域算法。
In this paper, we propose a new trust region algorithm for solving a class of composite nonsmooth optimization subject to convex constraints.
在一般可行集下，结合非光滑方程组解法及投影映射的性质，讨论了法方程求解变分不等式问题的算法构成。
Under general feasible set, in consideration of the algorithms for nonsmooth equations and the properties of projection map, the algorithms using the normal equation to solve are discussed.
给出了填充函数的区间扩张，并提出了求解该非光滑优化问题的区间填充函数算法。
It gives an interval enclosure for filled function and presents an interval filled function algorithm to solve this nonsmooth optimization.
提出复合非光滑优化问题的一类算法，并证明这种算法保持全局收敛性且敛速达到超线性。
This paper discusses a model algorithm for composite nonsmooth optimization problems and proves that the algorithm holds global convergence and in the meantime the convergent rate is superlinear.
针对非线性互补问题，提出了与其等价的非光滑方程的一个下降算法，并在一定条件下证明了该算法的全局收敛性。
This paper presents a new descend algorithm for nonlinear complementarity problems. The global convergence of the algorithm is proved under milder conditions.
针对非线性互补问题，提出了与其等价的非光滑方程的一个下降算法，并在一定条件下证明了该算法的全局收敛性。
This paper presents a new descend algorithm for nonlinear complementarity problems. The global convergence of the algorithm is proved under milder conditions.
应用推荐