We present a rigorous convergence analysis of a new method for density-based topology optimization that provides point-wise bound preserving design updates and faster convergence than other popular first-order topology optimization methods. Due to its strong bound preservation, the method is exceptionally robust, as demonstrated in numerous examples here and in the companion article [31]. Furthermore, it is easy to implement with clear structure and analytical expressions for the updates. Our analysis covers two versions of the method, characterized by the employed line search strategies. We consider a modified Armijo backtracking line search and a Bregman backtracking line search. For both line search algorithms, our algorithm delivers a strict monotone decrease in the objective function and further intuitive convergence properties, e.g., strong and pointwise convergence of the density variables on the active sets, norm convergence to zero of the increments, convergence of the Lagrange multipliers, and more. In addition, the numerical experiments demonstrate apparent mesh-independent convergence of the algorithm. We refer to the new algorithm as the SiMPL method, pronounced like ``simple", which stands for {Si}gmoidal {M}irror descent with a {P}rojected {L}atent variable.

翻译：本文对一种新型基于密度的拓扑优化方法进行了严格的收敛性分析，该方法能提供逐点保界的设计更新，且收敛速度优于其他常用的一阶拓扑优化方法。得益于其严格的保界特性，该方法展现出卓越的鲁棒性，这一点在本文及姊妹文献[31]的大量算例中均得到验证。此外，该方法结构清晰、更新过程具有解析表达式，易于实现。我们的分析涵盖该方法的两个版本，其区别在于采用的线搜索策略：改进的Armijo回溯线搜索与Bregman回溯线搜索。对于两种线搜索算法，本算法均能实现目标函数的严格单调递减，并具备更直观的收敛特性，例如：密度变量在有效集上的强收敛与逐点收敛、增量范数收敛至零、拉格朗日乘子的收敛性等。数值实验进一步表明，该算法具有明显的网格无关收敛特性。我们将这一新算法命名为SiMPL方法（发音同"simple"），其全称为：基于投影潜变量的{S}型{S}igmoidal {M}irror {P}rojected {L}atent变量下降法。