arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2202.05353math.OC
收藏

一种基于递归的多面体有效集算法的实现

A Gradient-Based Implementation of the Polyhedral Active Set Algorithm

William W. Hager, Hongchao Zhang

摘要:

多面体活动集算法(PASA)旨在优化多面体上的一般非线性函数。该算法的第一阶段是一个非单调梯度投影算法,而第二阶段是一个积极的集算法,探索面的约束多面体。提出了一种基于梯度的实现方法,其中在第二阶段采用共轭梯度算法的投影版本。渐进地,仅执行第二阶段。比较IPOPT使用多面体约束问题从CUTEst和Maros/Meszaros二次规划测试集。

英文摘要:

The Polyhedral Active Set Algorithm (PASA) is designed to optimize a general nonlinear function over a polyhedron. Phase one of the algorithm is a nonmonotone gradient projection algorithm, while phase two is an active set algorithm that explores faces of the constraint polyhedron. A gradient-based implementation is presented, where a projected version of the conjugate gradient algorithm is employed in phase two. Asymptotically, only phase two is performed. Comparisons are given with IPOPT using polyhedral constrained problems from CUTEst and the Maros/Meszaros quadratic programming test set.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑