Convergence properties of a conditional \(\varepsilon\)-subgradient method applied to linear programs (Q812414): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-005-2178-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2040567446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradients of Convex Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Subdifferentiability of Convex Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3724086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of descent for nondifferentiable optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4173599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank

Latest revision as of 10:34, 24 June 2024

scientific article
Language Label Description Also known as
English
Convergence properties of a conditional \(\varepsilon\)-subgradient method applied to linear programs
scientific article

    Statements

    Convergence properties of a conditional \(\varepsilon\)-subgradient method applied to linear programs (English)
    0 references
    23 January 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    convex (conjugate, recession, affine, polyhedral, support) function
    0 references
    domain
    0 references
    subdifferential
    0 references
    subgradient
    0 references
    \(\varepsilon\)-subdifferential
    0 references
    conditions \(\varepsilon\)-subdifferential
    0 references
    infimal convolution
    0 references
    polyhedral set
    0 references
    barrier cone
    0 references
    normal cone
    0 references
    convex programming
    0 references
    linear programming
    0 references
    dual problem
    0 references
    0 references