An inertial algorithm for DC programming (Q2281267): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q129077403, #quickstatements; #temporary_batch_1728077456503
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: iPiano / 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/s11228-018-0497-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2898522262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Image Recovery Using Variable Splitting and Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping / 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 new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3078296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of some algorithms for convex minimization / 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: Benchmarking optimization software with performance profiles. / 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: An Approach to Fractional Programming via D.C. Constraints Problem: Local Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4383822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / 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: Newton-Type Methods for Optimization and Variational Problems / 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: A DC optimization-based clustering technique for edge detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex image denoising via non-convex regularization with parameter selection / 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: Convergence of a splitting inertial proximal method for monotone operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: iPiano: Inertial Proximal Algorithm for Nonconvex Optimization / 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: Some methods of speeding up the convergence of iteration methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / 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: On local search in d.c. optimization problems / 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: Q3780016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heavy-ball method in nonconvex optimization problems / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129077403 / rank
 
Normal rank

Latest revision as of 23:03, 4 October 2024

scientific article
Language Label Description Also known as
English
An inertial algorithm for DC programming
scientific article

    Statements

    An inertial algorithm for DC programming (English)
    0 references
    0 references
    0 references
    19 December 2019
    0 references
    DC programming
    0 references
    nonsmooth optimization
    0 references
    variational analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references