当前位置: X-MOL 学术Math. Program. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A sequential homotopy method for mathematical programming problems
Mathematical Programming ( IF 2.7 ) Pub Date : 2020-03-23 , DOI: 10.1007/s10107-020-01488-z
Andreas Potschka , Hans Georg Bock

We propose a sequential homotopy method for the solution of mathematical programming problems formulated in abstract Hilbert spaces under the Guignard constraint qualification. The method is equivalent to performing projected backward Euler timestepping on a projected gradient/antigradient flow of the augmented Lagrangian. The projected backward Euler equations can be interpreted as the necessary optimality conditions of a primal-dual proximal regularization of the original problem. The regularized problems are always feasible, satisfy a strong constraint qualification guaranteeing uniqueness of Lagrange multipliers, yield unique primal solutions provided that the stepsize is sufficiently small, and can be solved by a continuation in the stepsize. We show that equilibria of the projected gradient/antigradient flow and critical points of the optimization problem are identical, provide sufficient conditions for the existence of global flow solutions, and show that critical points with emanating descent curves cannot be asymptotically stable equilibria of the projected gradient/antigradient flow, practically eradicating convergence to saddle points and maxima. The sequential homotopy method can be used to globalize any locally convergent optimization method that can be used in a homotopy framework. We demonstrate its efficiency for a class of highly nonlinear and badly conditioned control constrained elliptic optimal control problems with a semismooth Newton approach for the regularized subproblems.

中文翻译:

数学规划问题的序列同伦方法

我们提出了一种序列同伦方法,用于求解在 Guignard 约束条件下在抽象希尔伯特空间中制定的数学规划问题。该方法等效于对增广拉格朗日函数的投影梯度/反梯度流执行投影后向欧拉时间步长。投影后向欧拉方程可以解释为原始问题的原始对偶近端正则化的必要最优条件。正则化问题总是可行的,满足保证拉格朗日乘子唯一性的强约束条件,如果步长足够小,则产生唯一的原始解,并且可以通过步长中的延续来解决。我们证明了投影梯度/反梯度流的平衡和优化问题的临界点是相同的,为全局流解的存在提供了充分条件,并表明具有发射下降曲线的临界点不能是投影梯度的渐近稳定平衡/antigradient flow,实际上消除了对鞍点和最大值的收敛。顺序同伦方法可用于全球化任何可在同伦框架中使用的局部收敛优化方法。我们证明了它对一类高度非线性和条件差的控制约束椭圆最优控制问题的效率,对正则化子问题采用半光滑牛顿方法。为全局流解的存在提供充分条件,并表明具有发射下降曲线的临界点不能是投影梯度/反梯度流的渐近稳定平衡,实际上消除了对鞍点和最大值的收敛。顺序同伦方法可用于全球化任何可在同伦框架中使用的局部收敛优化方法。我们证明了它对一类高度非线性和条件差的控制约束椭圆最优控制问题的效率,对正则化子问题采用半光滑牛顿方法。为全局流解的存在提供充分条件,并表明具有发射下降曲线的临界点不能是投影梯度/反梯度流的渐近稳定平衡,实际上消除了对鞍点和最大值的收敛。顺序同伦方法可用于全球化任何可在同伦框架中使用的局部收敛优化方法。我们证明了它对一类高度非线性和条件差的控制约束椭圆最优控制问题的效率,对正则化子问题采用半光滑牛顿方法。顺序同伦方法可用于全球化任何可在同伦框架中使用的局部收敛优化方法。我们证明了它对一类高度非线性和条件差的控制约束椭圆最优控制问题的效率,对正则化子问题采用半光滑牛顿方法。顺序同伦方法可用于全球化任何可在同伦框架中使用的局部收敛优化方法。我们证明了它对一类高度非线性和条件差的控制约束椭圆最优控制问题的效率,对正则化子问题采用半光滑牛顿方法。
更新日期:2020-03-23
down
wechat
bug