本文提出了可行序列线性规划(Feasible Sequential Linear Programming,FSLP)的一个加速版本:AA(d)-FSLP算法。FSLP通过一种基于重复评估零阶信息的迭代更新策略,在所有中间迭代点保持可行性。该技术已成功应用于模型预测控制和滚动时域估计等方法,但可能表现出缓慢的收敛性。此外,在FSLP中保持所有迭代点可行需要大量额外的约束评估。本文将Anderson Acceleration(AA(d))应用于零阶更新策略,提高了收敛速率,从而减少了FSLP算法内部迭代过程中的约束评估次数。AA(d)在内层迭代中实现了改进的收缩率,并证明了局部线性收敛。此外,可以观察到,由于改进的零阶更新策略,AA(d)-FSLP采取更大的步长来寻找最优解,从而产生更快的整体收敛。针对并联SCARA机器人的时间最优点到点运动问题,检验了AA(d)-FSLP的性能。与FSLP相比,成功证明了约束评估次数和总迭代次数的减少。
英文摘要:
This paper proposes an accelerated version of Feasible Sequential Linear Programming (FSLP): the AA($d$)-FSLP algorithm. FSLP preserves feasibility in all intermediate iterates by means of an iterative update strategy which is based on repeated evaluation of zero-order information. This technique was successfully applied to techniques such as Model Predictive Control and Moving Horizon Estimation, but it can exhibit slow convergence. Moreover, keeping all iterates feasible in FSLP entails a large number of additional constraint evaluations. In this paper, Anderson Acceleration (AA($d$)) is applied to the zero-order update strategy improving the convergence rate and therefore decreasing the number of constraint evaluations in the inner iterative procedure of the FSLP algorithm. AA($d$) achieves an improved contraction rate in the inner iterations, with proven local linear convergence. In addition, it is observed that due to the improved zero-order update strategy, AA($d$)-FSLP takes larger steps to find an optimal solution, yielding faster overall convergence. The performance of AA($d$)-FSLP is examined for a time-optimal point-to-point motion problem of a parallel SCARA robot. The reduction of the number of constraint evaluations and overall iterations compared to FSLP is successfully demonstrated.
Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties
Zuse Institute Berlin(柏林祖斯研究所);Technische Universität Berlin(柏林工业大学)
我们提出了一种全局加速的一阶方法,用于在广泛的一类Hadamard流形中优化光滑和(强或非)测地线凸函数。我们实现了与Nesterov加速梯度下降相同的收敛速度,直到乘法几何惩罚和对数因子。至关重要的是,我们可以强制我们的方法保持在我们定义的紧致集内。现有的完全加速的作品\emph{resort to assuming},他们的算法的迭代停留在一些预先指定的紧集,除了两个有限的适用性的前方法。对于我们的流形,这解决了[KY22]中关于获得全局广义加速度而不迭代地停留在可行集中的公开问题。在我们的解决方案中,我们设计了一个加速的黎曼不精确邻近点法,这是一个结果,是未知的,甚至与精确访问的邻近算子,是独立的利益。对于光滑函数,我们证明了我们可以在一定直径的黎曼球上用一阶方法不精确地实现逼近步骤,这足以进行全局加速优化。
Adaptive two-points zero-order accelerated methods for stochastic convex optimization problems
IAI MSU(莫斯科国立大学信息算法研究所);Innopolis University(因诺波利斯大学);MIRIAI(俄罗斯科学院人工智能研究院);MBZUAI(穆罕默德·本·扎耶德人工智能大学);HSE University(高等经济大学);Trusted AI Research Center, RAS(俄罗斯科学院可信人工智能研究中心);Steklov Mathematical Institute, RAS(俄罗斯科学院斯捷克洛夫数学研究所)
GPU-accelerated superiorization on constrained physical problems with SupPy
German Cancer Research Center (DKFZ)(德国癌症研究中心);Heidelberg University(海德堡大学);Heidelberg Institute of Radiation Oncology (HIRO)(海德堡放射肿瘤学研究所);National Center for Radiation Research in Oncology (NCRO)(国家肿瘤放射研究中心);University of Haifa(海法大学)
B$^3$-PWL: GPU-Batched Branch-and-Bound for Piecewise-Linear Optimization with SOS2 Constraints
Johns Hopkins University(约翰斯·霍普金斯大学);University of North Carolina, Chapel Hill(北卡罗来纳大学教堂山分校);City University of Hong Kong(香港城市大学);The Hong Kong Institute of AI for Science(香港人工智能科学研究所)