Pseudotransient continuation for solving systems of nonsmooth equations with inequality constraints (Q613599)

From MaRDI portal
Revision as of 13:48, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Pseudotransient continuation for solving systems of nonsmooth equations with inequality constraints
scientific article

    Statements

    Pseudotransient continuation for solving systems of nonsmooth equations with inequality constraints (English)
    0 references
    0 references
    0 references
    21 December 2010
    0 references
    Let \(f:\mathbb{R}^{n}\longrightarrow \mathbb{R}^{n}\) and \(g:\mathbb{R} ^{n}\longrightarrow \mathbb{R}^{m}\) be semismooth functions. The authors introduce a slack variable \(\gamma \in \mathbb{R}^{m}\) to reformulate the system \(f(x)=0,\) \(g(x)\leq 0\) as \(F(u)=0,\) \(\gamma \geq 0\), with \( u=(x,\gamma )\) and \(F(u)=(f(x),g(x)+\gamma )\). Among other assumptions, they impose on \(F\) a BD-regularity condition in the sense of \textit{J. M. Martinez} and the second author [J. Comput. Appl. Math. 60, 127--145 (1995; Zbl 0833.65045)], which allows for the applicability of the projected pseudotransient continuation algorithm of \textit{C. T. Kelley, Li-Zhi Liao, Liqun Qi, Moody T. Chu, J. P. Reese} and \textit{C. Winton} [SIAM J. Numer. Anal. 46, No.~6, 3071--3083 (2008; Zbl 1180.65060)] to solve the reformulated system. A global convergence theorem is proved and the results of some numerical tests are reported.
    0 references
    nonsmooth equations
    0 references
    inequality systems
    0 references
    pseudotransient continuation
    0 references
    global convergence
    0 references
    inequality constraints
    0 references
    semismooth Newton method
    0 references
    numerical examples
    0 references
    algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references