An augmented subgradient method for minimizing nonsmooth DC functions (Q2231043): 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-021-00304-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3184658784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating the DC algorithm for smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalty and error bounds in DC programming / 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: DC models for spherical separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Nonsmooth Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Nonsmooth Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregate subgradient method for nonsmooth DC optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental DC optimization algorithm for large-scale clusterwise linear regression / 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: Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms / 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: A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal bundle methods for nonsmooth DC programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential difference-of-convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ABC of DC programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inertial algorithm for DC programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite quadratic problems within nonsmooth optimization algorithms / 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: DC programming: overview. / 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: Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A DC optimization-based clustering technique for edge detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth optimization via quasi-Newton methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3346095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for solving the minimum sum-of-squares clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing B-Stationary Points of Nonsmooth DC Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4470269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the nearest point in A polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4762488 / rank
 
Normal rank

Latest revision as of 17:08, 26 July 2024

scientific article
Language Label Description Also known as
English
An augmented subgradient method for minimizing nonsmooth DC functions
scientific article

    Statements

    An augmented subgradient method for minimizing nonsmooth DC functions (English)
    0 references
    0 references
    29 September 2021
    0 references
    nonsmooth optimization
    0 references
    nonconvex optimization
    0 references
    DC optimization
    0 references
    subgradients
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers