Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming (Q4571882): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MPBNGC / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Margin maximization in spherical separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Minimization of Quasidifferentiable Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Nonsmooth Optimization / 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: Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and nonsmooth analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751334 / 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: A splitting bundle approach for non-smooth non-convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient set splitting in nonconvex nonsmooth numerical optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On functions representable as a difference of convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A production-transportation problem with stochastic demand and concave production costs / 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: Methods of descent for nondifferentiable optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity control in bundle methods for convex nondifferentiable minimization / 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: Exact penalty and error bounds in DC programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3346095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of Bundle Methods for Nonsmooth Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Constrained Optimization with Semismooth Functions / 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: Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming / 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: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results / 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: Q3208459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and global optimization / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/16m1115733 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2810034112 / rank
 
Normal rank

Latest revision as of 10:46, 30 July 2024

scientific article; zbMATH DE number 6898126
Language Label Description Also known as
English
Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
scientific article; zbMATH DE number 6898126

    Statements

    Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    nonsmooth optimization
    0 references
    nonconvex optimization
    0 references
    DC functions
    0 references
    bundle methods
    0 references
    cutting plane model
    0 references
    Clarke stationarity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references