Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions (Q4742570): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Newton's method for convex programming and Tschebyscheff approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization / 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: Steplength algorithms for minimizing a class of nondifferentiable functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4199833 / rank
 
Normal rank

Latest revision as of 17:06, 13 June 2024

scientific article; zbMATH DE number 3797508
Language Label Description Also known as
English
Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
scientific article; zbMATH DE number 3797508

    Statements

    Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions (English)
    0 references
    0 references
    0 references
    1982
    0 references
    polyhedral approximation
    0 references
    nonsmooth optimization
    0 references
    univariate optimization
    0 references
    quadratic approximation
    0 references
    superlinear convergence
    0 references
    local piece-wise linear approximation
    0 references
    unconstrained minimization problem
    0 references
    polyhedral method
    0 references
    subgradient
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references