...Convex constrained optimization, projected gradient, nonmonotone line search, spectral gradient, Dykstra’s algo[gap=269]关键词：凸约束优化，投影梯度，非单调线搜索，谱梯度，Dykstra的算法。的AMS主题分类：49M07，49M10，65K，90C06，90C20。
基于6个网页-相关网页
convex constrained optimization 凸约束的非线性规划问题 收藏 convex composite optimization 复合凸优化 收藏 .
基于1个网页-相关网页
In this paper, we develop a trust region algorithm for convex constrained optimization problems.
本文我们考虑求解凸约束优化问题的信赖域方法。
In convex programming theory, a constrained optimization problem, by KT conditions, is usually converted into a mixed nonlinear complementarity problem.
在凸规划理论中，通过KT条件，往往将约束最优化问题归结为一个混合互补问题来求解。
The Chaotic neural network model can be used to solve many multi-dimensioned, discrete, non-convex, nonlinear constrained optimization problems.
基于混沌神经网络模型可以有效地解决高维、离散、非凸的非线性约束优化问题。
应用推荐