| 1. | A quasi - newton method on convex optimization
求解凸规划问题的一种拟牛顿算法 |
| 2. | The convergence of an algorithm for the reverse convex programming
一类反凸规划算法的收敛性 |
| 3. | The affine scaling algorithm for convex programming with linear constraints
线性约束凸规划问题的仿尺度算法 |
| 4. | Convex programming problem
凸规划问题 |
| 5. | Solving linearly constrained convex programming by potential reduction interior - point algorithm
求解线性约束凸规划的势下降内点算法 |
| 6. | This paper presents an interior trust region method for linear constrained lc ^ 1 convex optimization problems
摘要本文提出一种解线性约束凸规划的数值方法。 |
| 7. | Finally , the relationships between generalized set - valued variational inclusion problems and non - convex programming are studied
最后研究了广义集值变分包含问题与非凸规划之间的关系。 |
| 8. | Fifthly , the parameter control methods for solving convex programming , especially linear programming and convex quadratic programming , are discussed and its convergence iv is probed
五是研究了凸规划包括线性规划和凸二次规划的参数控制算法及其收敛性。 |
| 9. | Abstract : this paper presents a new primal ? dual interior point algorithm for a convex programming with box constraints , and prove the iteration complexity is polynomial
文摘:本文为框式约束的一类凸规划提出了一个新的内点算法，原始-对偶路径跟踪法，并证明了算法的迭代复杂性为多项式时间性 |
| 10. | We solved multiobject nonconvex programming by means of homotopy - interior method and got the minimum weak effect solution under quasi - normal cone condition ; meanwhile we proved the convergence of this method
摘要利用同伦内点算法求解多目标非凸规划在拟锥条件下的最小弱有效解，并证明了算法的大范围收敛性。 |
