Aggregate subgradient method for nonsmooth DC optimization (Q1996741): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Two ``well-known'' properties of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quasisecant method for minimizing nonsmooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgradient method for nonconvex nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete gradient method: Derivative-free method for nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Nonsmooth Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate ADMM for solving linearly constrained nonsmooth optimization problems with two blocks of variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codifferential method for minimizing nonsmooth DC functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective line search for the subgradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A DC piecewise affine model and a bundling technique in nonconvex nonsmooth 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: Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: New limited memory bundle method for large-scale nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent limited memory bundle method for large-scale nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Redistributed Proximal Bundle Method for Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of Shor's \(r\)-algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of descent for nondifferentiable optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bundle-Newton method for nonsmooth unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Stochastic Approximation Approach to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual subgradient methods for convex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of a proximal linearized algorithm for difference of convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimality conditions for nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and global optimization / rank
 
Normal rank

Revision as of 16:04, 24 July 2024

scientific article
Language Label Description Also known as
English
Aggregate subgradient method for nonsmooth DC optimization
scientific article

    Statements

    Aggregate subgradient method for nonsmooth DC optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 February 2021
    0 references
    nonsmooth optimization
    0 references
    nonconvex optimization
    0 references
    DC optimization
    0 references
    subgradient method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers