A method for minimizing convex functions based on continuous approximations to the subdifferential (Q4391285): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 11: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
unconstrained minimization of nondifferentiable convex functions
0 references
continuous approximation
0 references
subdifferential
0 references