Sequential quadratic programming with rational move limits - 文章详情页

作者：

Sui, Yun-Kang (Sui, Yun-Kang.) | Zhang, Ai-Qing (Zhang, Ai-Qing.) | Long, Lian-Chun (Long, Lian-Chun.) (学者：龙连春)

收录：

EI Scopus PKU CSCD

摘要：

The　basic　idea　of　the　sequential　quadratic　programming　(SQP)　algorithm　is　to　approximate　and　initial　model　with　a　sequence　of　quadratic　programming　(QP)　sub-problems.　To　choose　rational　move　limits　box　(super-polyhedron)　for　QP　sub-problems,　a　new　SQP　algorithm,　SQPRML　is　presented.　Hence,　the　problem　of　search　direction　is　solved　in　a　more　rational　method,　and　it　facilitates　to　obtain　search　step　size.　Numerical　examples　are　presented　which　show　that　the　algorithm　is　feasible　and　efficient.

关键词：

Constrained optimization Quadratic programming

作者机构：

[ 1 ] [Sui, Yun-Kang]College of Mechanical Engineering and Applied Electronics Technology, Beijing University of Technology, Beijing 100022, China
[ 2 ] [Zhang, Ai-Qing]College of Mechanical Engineering and Applied Electronics Technology, Beijing University of Technology, Beijing 100022, China
[ 3 ] [Long, Lian-Chun]College of Mechanical Engineering and Applied Electronics Technology, Beijing University of Technology, Beijing 100022, China

通讯作者信息：

电子邮件地址：

查看成果更多字段

成果类型
所属机构

所有年份指定年份从至