On the convergence of projected gradient processes to singular critical points (Q1821692): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: On the Goldstein-Levitin-Polyak gradient projection method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programming in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected Newton Methods for Optimization Problems with Simple Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Steepest Descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of superlinearly convergent projection algorithms with relaxed stepsizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Metric Projection Methods for Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic decay rates from the growth properties of Lyapunov functions near singular attractors / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00939081 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090243370 / rank
 
Normal rank

Latest revision as of 09:54, 30 July 2024

scientific article
Language Label Description Also known as
English
On the convergence of projected gradient processes to singular critical points
scientific article

    Statements

    On the convergence of projected gradient processes to singular critical points (English)
    0 references
    0 references
    1987
    0 references
    The projected gradient methods treated here generate iterates by the rule \(x_{k+1}=P_{\Omega}(x_ k-s_ k\nabla F(x_ k))\), \(x_ 1\in \Omega\), where \(\Omega\) is a closed convex set in a real Hilbert space X, \(s_ k\) is a positive real number determined by Goldstein's condition, \(P_{\Omega}\) projects X into \(\Omega\), F is a differentiable function whose minimum is sought in \(\Omega\), and \(\nabla F\) is locally Lipschitz continuous. Asymptotic stability and convergence rate theorems are proved for singular local minimizers \(\xi\) in the interior of \(\Omega\), or more generally, in some open facet in \(\Omega\). The stability theorem requires that: (i) \(\xi\) is a proper local minimizer and F grows uniformly in \(\Omega\) near \(\xi\) ; (ii) -\(\nabla F(\xi)\) lies in the relative interior of the cone \({\mathcal K}_{\xi}\) of outer normals to \(\Omega\) at \(\xi\) ; and (iii) \(\xi\) is an isolated critical point and the defect \(\| P_{\Omega}(x-\nabla F(x))-x\|\) grows uniformly within the facet containing \(\xi\). The convergence rate theorem imposes (i) and (ii), and also requires that: (iv) F is \(C^ 4\) near \(\xi\) and grows no slower than \(\| x-\xi \| ^ 4\) within the facet; and (v) the projected Hessian operator \(P_{{\mathcal T}_{\xi}}\nabla _ 2F(\xi)| _{{\mathcal T}_{\xi}}\) is positive-definite on its range in the subspace \({\mathcal T}_{\xi}\) orthogonal to \({\mathcal K}_{\xi}\). Under these conditions, \(\{x_ k\}\) converges to \(\xi\) from nearby starting points \(x_ 1\), with \(F(x_ k)-F(\xi)=O(k^{-2})\) and \(\| x_ k-\xi \| =O(k^{- 1/2})\). No explicit or implied local pseudoconvexity or level set compactness demands are imposed on F in this analysis. Furthermore, condition (v) and the uniform growth stipulations in (i) and (iii) are redundant in \({\mathbb{R}}^ n\).
    0 references
    projected gradient methods
    0 references
    asymptotic stability
    0 references
    convergence rate theorems
    0 references
    convex feasible sets
    0 references
    nonconvex objective functions
    0 references
    singular minimizers
    0 references

    Identifiers

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