Show simple item record

dc.contributor.author朱志斌
dc.contributor.author张可村
dc.contributor.author简金宝
dc.date.accessioned2017-11-14T02:50:55Z
dc.date.available2017-11-14T02:50:55Z
dc.date.issued2007-03-15
dc.identifier.citation数学学报,2007,(02):43-52
dc.identifier.issn0583-1431
dc.identifier.otherSXXB200702006
dc.identifier.urihttps://dspace.xmu.edu.cn/handle/2288/154736
dc.description.abstract本文针对非线性不等式约束优化问题,提出了一个新的可行序列等式约束二次规划算法.在每次迭代中,该算法只需求解三个相同规模且仅含等式约束的二次规划(必要时求解一个辅助的线性规划),因而其计算工作量较小.在一般的条件下,证明了算法具有全局收敛及超线性收敛性.数值实验表明算法是有效的.
dc.description.abstractIn this paper,a feasible sequential equality constrained quadratic program- ming algorithm is proposed to solve the nonlinear inequality constrained optimization. Per single iteration,it is only neccessary to sovle three equality constrained quadratic programmings with the same scale(or in addition,a linear programming),so the com- putational effort is reduced.The theoretical analysis shows that the algorithm is global and superlinear convergence under some suitable conditions.Numerical results show that the method in this paper is effective.
dc.description.sponsorship国家自然科学基金(10501009,60471039,10661005)
dc.language.isozh_CN
dc.subject不等式约束优化
dc.subjectSQP算法
dc.subject等式约束二次规划
dc.subjectInequality constrained optimization
dc.subjectSQP method
dc.subjectequality constrained quadratic programming
dc.title非线性最优化一个可行序列等式约束二次规划算法
dc.title.alternativeA Feasible Equality Constrained SQP Algorithm for Nonlinear Optimization
dc.typeArticle


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record