A general framework for the over-relaxed A-proximal point algorithm and applications to inclusion problems (Q1021801): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.aml.2008.05.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972137641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Operators and the Proximal Point Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4463121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(A\)-monotonicity and its role in nonlinear variational inclusions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a new system of nonlinear \(A\)-monotone multivalued variational inclusions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation solvability of a class of nonlinear set-valued variational inclusions involving \((A,\eta )\)-monotone mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992492 / rank
 
Normal rank

Revision as of 15:00, 1 July 2024

scientific article
Language Label Description Also known as
English
A general framework for the over-relaxed A-proximal point algorithm and applications to inclusion problems
scientific article

    Statements

    A general framework for the over-relaxed A-proximal point algorithm and applications to inclusion problems (English)
    0 references
    0 references
    9 June 2009
    0 references
    Using the concept of \(A\)-monotonicity in a Hilbert space, the author applies the generalized over-relaxed A-proximal point algorithm to approximate the solution of the following inclusion problem: Find \(x\) such that \(0\in Mx\). As a result, linear convergence of the resulting method is established under standard assumptions.
    0 references
    variational inclusions
    0 references
    maximal monotone mapping
    0 references
    \(A\)-maximal monotone mapping
    0 references
    generalized resolvent operator
    0 references
    over-relaxed \(A\)-proximal point algorithm
    0 references

    Identifiers