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

求解非线性绝对值方程

Solving Nonlinear Absolute Value Equations

Aris Daniilidis, Mounir Haddou, Tri Minh Le, Olivier Ley, Phi Hoang Tran

AI总结:

本文将非线性绝对值方程转化为非线性互补问题,并利用平滑正则化技术高效求解,首次直接处理NAVE问题,证明技术假设等价于经典不等式,扩展误差估计并应用于非对称岭优化和非线性常微分方程。

摘要:

在本文中,我们证明了若干自然表示为非线性绝对值方程(NAVE)的问题可以转化为非线性互补问题(NCP)并利用平滑正则化技术在较弱假设下高效求解。到目前为止,这第一次直接处理NAVE的数值方法。我们还识别了平滑技术中常用的技术假设,并证明其等价于经典__ojasiewicz不等式在无穷远处,验证了其非限制性。此外,我们扩展了已建立的NCP求解器的误差估计,以在较弱假设下推导NAVE问题的误差界。我们通过非对称岭优化和非线性常微分方程的应用来说明我们方法的有效性。

英文摘要:

In this work, we show that several problems naturally represented as Nonlinear Absolute Value Equations (NAVE) can be reformulated as Nonlinear Complementarity Problems (NCP) and efficiently solved using smoothing regularization techniques under mild assumptions. As far as we know, this is the first numerical approach that directly deals with NAVE. We also identify a technical assumption commonly utilized in smoothing techniques and prove its equivalence to a classical __ojasiewicz inequality at infinity, validating its non-restrictive nature. Furthermore, we extend established error estimates for NCP solvers to derive error bounds for NAVE problems under weaker assumptions. We illustrate the effectiveness of our approach through applications including asymmetric ridge optimization and nonlinear ordinary differential equations.

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

↑