A method for minimizing convex functions based on continuous approximations to the subdifferential (Q4391285): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/10556789808805683 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014786863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Models for Nondifferentiable Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the nearest point in A polytope / rank
 
Normal rank

Latest revision as of 12:40, 28 May 2024

scientific article; zbMATH DE number 1158147
Language Label Description Also known as
English
A method for minimizing convex functions based on continuous approximations to the subdifferential
scientific article; zbMATH DE number 1158147

    Statements

    A method for minimizing convex functions based on continuous approximations to the subdifferential (English)
    0 references
    2 June 1998
    0 references
    0 references
    unconstrained minimization of nondifferentiable convex functions
    0 references
    continuous approximation
    0 references
    subdifferential
    0 references
    0 references
    0 references