欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
利用函数逼近论的思想和数学规划最优解的稳定性理论，提出了一种求解非线性约束的极大极小问题的信赖域拟牛顿算法，并且该算法具有全局收敛性，初步的数值试验表明，对于该类极大极小问题，该算法具有良好的数值表现。
英文摘要：
Based on the theory of function approximation and the stability theory of optimal solutions in mathematical programming, a trust-region quasi-Newton method for solving the minimax problem with nonlinear constraints is proposed. The algorithm which resolves general minimax problems is global convergent. Preliminary numerical experiments show that the proposed algorithm is effective.
同期刊论文项目
同项目期刊论文
A general projection gradient method for linear constrained optimization with superlinear convergenc
A Superlinearly Convergent SQP Algorithm for Mathematical Programs
with Linear Complementarity Const
A globally and superlinearly convergent smoothing Broyden-like method for solving nonlinear compleme
An interior point type QP-free algorithm with superlinear convergence for inequality constrained opt
A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity cons
A Sequential Equality Constrained Quadratic Programming Algorithm
for Inequality Constrained Optimiz
A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity const
期刊信息
位置：