Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (Q2697002): 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/s10957-023-02171-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4322732110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC formulations and algorithms for sparse optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further properties of the forward-backward envelope with applications to difference-of-convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds and convergence analysis of feasible descent methods: A general approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression / 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: Convex analysis approach to d. c. programming: Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis / 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 programming and DCA: thirty years of developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence analysis of difference-of-convex algorithm with subanalytic data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coordinate gradient descent method for nonsmooth separable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal difference-of-convex algorithm with extrapolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly unbiased variable selection under minimax concave penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to error bounds for structured convex optimization problems / rank
 
Normal rank

Latest revision as of 23:10, 31 July 2024

scientific article
Language Label Description Also known as
English
Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity
scientific article

    Statements

    Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (English)
    0 references
    0 references
    0 references
    17 April 2023
    0 references
    difference-of-convex programming
    0 references
    difference-of-convex algorithm
    0 references
    linear convergence
    0 references
    error bound
    0 references
    0 references

    Identifiers