Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization (Q3310490): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimization of upper semidifferentiable functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Gradients and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4078579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semismooth and Semiconvex Functions in Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank

Latest revision as of 10:27, 14 June 2024

scientific article
Language Label Description Also known as
English
Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization
scientific article

    Statements

    Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization (English)
    0 references
    0 references
    1984
    0 references
    superlinear convergence
    0 references
    nonsmooth optimization
    0 references
    constrained minimization
    0 references
    locally Lipschitz functions
    0 references
    line search
    0 references
    polyhedral and quadratic approximation
    0 references

    Identifiers

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