An inexact algorithm for composite nondifferentiable optimization (Q1823153): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q920830
Property / reviewed by
 
Property / reviewed by: John J. Dinkel / rank
Normal rank
 

Revision as of 14:11, 21 February 2024

scientific article
Language Label Description Also known as
English
An inexact algorithm for composite nondifferentiable optimization
scientific article

    Statements

    An inexact algorithm for composite nondifferentiable optimization (English)
    0 references
    0 references
    1989
    0 references
    The paper presents an inexact version of Fletcher's trust-region algorithm with second-order corrections for minimizing composite non- smooth functions. The composite non-smooth optimization problem is: \(\min \{f(x)+h(c(x))\}\), where f and c are twice continuously differentiable and h is a polyhedral convex function of the form \(h(c)=\max h^ T_ ic+b_ i.\) This paper modifies the second-order correction method of \textit{R. Fletcher} [Numerical analysis, Proc. 9th Bienn. Conf., Dundee/Scotl. 1981, Lect. Notes Math. 912, 85-114 (1982; Zbl 0476.65048)] to allow inexactness in the solution of the subproblem at each iteration. The modified algorithm is shown to retain the global and local convergence properties of the original method under certain conditions.
    0 references
    inexact version
    0 references
    Fletcher's trust-region algorithm
    0 references
    second-order corrections
    0 references
    composite non-smooth functions
    0 references
    convergence properties
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references