On the problem of minimizing a difference of polyhedral convex functions under linear constraints (Q346824): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An aggregate subgradient method for nonsmooth and nonconvex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On global unconstrained minimization of the difference of polyhedral functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3723176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4762475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mordukhovich subdifferential of pointwise minimum of approximate convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3905599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996569 / rank
 
Normal rank

Latest revision as of 01:08, 13 July 2024

scientific article
Language Label Description Also known as
English
On the problem of minimizing a difference of polyhedral convex functions under linear constraints
scientific article

    Statements

    On the problem of minimizing a difference of polyhedral convex functions under linear constraints (English)
    0 references
    0 references
    0 references
    30 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    d.p. programming
    0 references
    subdifferential
    0 references
    optimality conditions
    0 references
    stationary point
    0 references
    density
    0 references
    active index set
    0 references
    extreme point
    0 references
    0 references