Calculation of fixed points of extremal mappings by gradient-type methods (Q1974721)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Calculation of fixed points of extremal mappings by gradient-type methods
scientific article

    Statements

    Calculation of fixed points of extremal mappings by gradient-type methods (English)
    0 references
    18 June 2000
    0 references
    A class of skew-symmetric functions similar to the class of convex functions in nonlinear programming is introduced for an extremal problem in the form \[ \nu^*\in\text{argmin}\bigl \{\Phi(\nu^*,w)\mid w\in\Omega \bigr\} \] where \(\nu,w\in\mathbb{R}^n\), \(\Omega\subset\mathbb{R}^n\) is a convex closed set. It is shown that a condition holds in this class that ensures the stability of a fixed point. The gradient method for finding fixed point \(\nu^*\) of problem is proposed in the form \[ \nu^{k+1} =\pi_\Omega (\nu^k)-\alpha \nabla_w \Phi(\nu^k, \nu^k) \] where \(\pi_\Omega (\cdot)\) is the operator of projection onto \(\Omega\). \(\alpha>0\) is a parameter and \(\nabla_w \Phi(\nu,w)\) is the partial gradient of \(\Phi(\nu,w)\) with respect to \(w\). Convergence of the gradient methods to sharp, quadratic and degenerate equilibrium points of extremal mapping is proved.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling algorithm
    0 references
    network
    0 references
    resources
    0 references
    optimal distribution
    0 references
    skew-symmetric functions
    0 references
    nonlinear programming
    0 references
    stability
    0 references
    fixed point
    0 references
    gradient methods
    0 references
    equilibrium
    0 references
    extremal mapping
    0 references