求解带有机会约束的非线性优化问题的一种经验分位数估计方法
An Empirical Quantile Estimation Approach to Nonlinear Optimization Problems with Chance Constraints
AI总结:
本文提出一种基于经验分位数估计的方法求解机会约束非线性优化问题,通过将机会约束转化为等价分位数约束并利用有限差分近似梯度,在增广拉格朗日框架下证明了收敛性,且无需平滑函数,更易实现。
摘要:
我们研究了一种经验分位数估计方法,用于求解带有机会约束的非线性优化问题。该方法基于将机会约束重新表述为等价的分位数约束,以提供更强的梯度信号。在此方法中,分位数函数的值通过从随机参数中抽取的样本进行经验估计,而分位数函数的梯度则通过在分位数函数值估计基础上的有限差分近似来估计。我们在求解一般非线性约束优化问题的增广拉格朗日方法框架内,建立了该方法的收敛性理论。收敛性分析的基础是经验分位数过程的集中性质,并根据分位数函数是否可微对分析进行了划分。与文献中使用的采样与平滑方法相比,本文开发的方法不涉及任何平滑函数,因此分位数函数梯度近似更易于实现,且需要调节的精度控制参数更少。我们展示了该方法的有效性,并将其与用于分位数梯度估计的平滑方法进行了比较。数值研究表明,这两种方法在特定问题实例上具有竞争力。
英文摘要:
We investigate an empirical quantile estimation approach to solve chance-constrained nonlinear optimization problems. Our approach is based on the reformulation of the chance constraint as an equivalent quantile constraint to provide stronger signals on the gradient. In this approach, the value of the quantile function is estimated empirically from samples drawn from the random parameters, and the gradient of the quantile function is estimated via a finite-difference approximation on top of the quantile-function-value estimation. We establish a convergence theory of this approach within the framework of an augmented Lagrangian method for solving general nonlinear constrained optimization problems. The foundation of the convergence analysis is a concentration property of the empirical quantile process, and the analysis is divided based on whether or not the quantile function is differentiable. In contrast to the sampling-and-smoothing approach used in the literature, the method developed in this paper does not involve any smoothing function and hence the quantile-function gradient approximation is easier to implement and there are less accuracy-control parameters to tune. We demonstrate the effectiveness of this approach and compare it with a smoothing method for the quantile-gradient estimation. Numerical investigation shows that the two approaches are competitive for certain problem instances.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。