arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.00733math.OC
收藏

关于“连续凸化:一种用于非凸最优控制问题的超线性收敛算法”的评注

Remarks on "Successive Convexification: A Superlinearly Convergent Algorithm for Non-convex Optimal Control Problems"

Dayou Luo, Purnanand Elango, Behcet Acikmese

AI总结:

本文指出SCvx算法收敛证明中的错误,并在更严格假设下用新方法重新建立其收敛性,以纠正不准确之处。

摘要:

本文旨在指出并解决Mao等人(arXiv:1804.06539)提出的非凸轨迹优化算法SCvx在收敛性保证上的不准确之处,并联系相关先前工作。具体而言,我们识别了Mao等人(arXiv:1804.06539)收敛证明中的错误,并在更严格的假设下采用新方法重新建立了收敛性证明。

英文摘要:

The purpose of this note is to highlight and address inaccuracies in the convergence guarantees of SCvx, a nonconvex trajectory optimization algorithm proposed by Mao et al. (arXiv:1804.06539), and make connections to relevant prior work. Specifically, we identify errors in the convergence proof within Mao et al. (arXiv:1804.06539) and reestablish the proof of convergence by employing a new method under stricter assumptions.

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

↑