A class of convergent primal-dual subgradient algorithms for decomposable convex programs (Q3725884): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the choice of step size in subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3865860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A descent algorithm for nonsmooth convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3334893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An aggregate subgradient method for nonsmooth convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3316093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of unsmooth functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual approach to solving nonlinear programming problems by unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiplier method of Hestenes and Powell applied to convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3223439 / rank
 
Normal rank

Revision as of 13:43, 17 June 2024

scientific article
Language Label Description Also known as
English
A class of convergent primal-dual subgradient algorithms for decomposable convex programs
scientific article

    Statements

    A class of convergent primal-dual subgradient algorithms for decomposable convex programs (English)
    0 references
    0 references
    0 references
    1986
    0 references
    primal-dual subgradient algorithm
    0 references
    nondifferentiable
    0 references
    convex programming
    0 references
    Lagrangian dual function
    0 references
    penalty function
    0 references
    stopping criterion
    0 references

    Identifiers