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

计算约束最优化问题平稳解的罚方法

Penalty methods to compute stationary solutions in constrained optimization problems

Ashkan Mohammadi

摘要:

本文通过相应的无约束惩罚问题研究了一般约束最优化问题的平稳解。我们的目标是回答这样一个问题:“关于原始约束最优化问题的解,惩罚无约束问题的静态解告诉我们什么?”".我们通过建立全局(局部)极小值和两个最优化问题的稳定点之间的关系来回答后一个问题。考虑到问题的平稳解之间的强联系,我们引入了一个新的近似$\varepsilon$ -平稳解的约束最优化问题。我们提出了一个算法来计算这样一个近似的固定解决方案的一般约束最优化问题,即使在没有克拉克正则性。在合理的假设下,我们建立了我们的算法的速率$O(\varepsilon^{-2})$,类似于平滑最小化的梯度下降法。由于我们的惩罚项是由距离函数的幂构造的,所以我们的平稳性分析在很大程度上依赖于距离函数的广义微分。特别是,我们的特点(半)可微的距离函数$\mbox{dist}(. ;X)$定义的Fréchet光滑范数,在几何的集合$X$。证明了$\mbox{dist} (. ;X)$是半可微的当且仅当$X$是几何可导的.后者打开了大门,设计优化算法的约束最优化问题,遭受克拉克不规则的目标和约束函数。

英文摘要:

This paper is devoted to studying the stationary solutions of a general constrained optimization problem through its associated unconstrained penalized problems. We aim to answer the question, "what do the stationary solutions of a penalized unconstrained problem tell us about the solutions of the original constrained optimization problem?". We answer the latter question by establishing relationships between global (local) minimizers and stationary points of the two optimization problems. Given the strong connection between stationary solutions between problems, we introduce a new approximate $\varepsilon$-stationary solution for the constrained optimization problems. We propose an algorithm to compute such an approximate stationary solution for a general constrained optimization problem, even in the absence of Clarke regularity. Under reasonable assumptions, we establish the rate $O(\varepsilon^{-2})$ for our algorithm, akin to the gradient descent method for smooth minimization. Since our penalty terms are constructed by the powers of the distance function, our stationarity analysis heavily depends on the generalized differentiation of the distance function. In particular, we characterize the (semi-)differentiability of the distance function $\mbox{dist}(. ;X)$ defined by a Fréchet smooth norm, in terms of the geometry of the set $X$. We show that $\mbox{dist} (. ;X)$ is semi-differentiable if and only if $X$ is geometrically derivable. The latter opens the door to design optimization algorithms for constrained optimization problems that suffer from Clarke irregularity in their objectives and constraint functions.

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

↑