A gradient sampling method based on ideal direction for solving nonsmooth optimization problems (Q831368): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10957-020-01740-8 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10957-020-01740-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3081934664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive gradient sampling algorithm for non-smooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the local convergence analysis of the gradient sampling method for finite max-functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast gradient and function sampling method for finite-max functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Nonsmooth Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of descent for nondifferentiable optimization / 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: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10957-020-01740-8 / rank
 
Normal rank

Latest revision as of 04:29, 10 December 2024

scientific article
Language Label Description Also known as
English
A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
scientific article

    Statements

    A gradient sampling method based on ideal direction for solving nonsmooth optimization problems (English)
    0 references
    0 references
    0 references
    11 May 2021
    0 references
    nonsmooth and nonconvex optimization
    0 references
    subdifferential
    0 references
    steepest descent direction
    0 references
    gradient sampling
    0 references
    Armijo line search
    0 references
    0 references
    0 references
    0 references

    Identifiers