An inertial algorithm for DC programming (Q2281267)

From MaRDI portal

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

An inertial algorithm for DC programming (English)

0 references

Welington de Oliveira

0 references

Michel P. Tcheou

0 references

Set-Valued and Variational Analysis

0 references

publication date

19 December 2019

0 references

zbMATH Keywords

DC programming

0 references

nonsmooth optimization

0 references

variational analysis

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11228-018-0497-0

0 references

Fast Image Recovery Using Variable Splitting and Constrained Optimization

0 references

Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space

0 references

An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping

0 references

The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems

0 references

A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems

0 references

Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems

0 references

On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions

0 references

0 references

A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms

0 references

Convergence of some algorithms for convex minimization

0 references

Proximal bundle methods for nonsmooth DC programming

0 references

Benchmarking optimization software with performance profiles.

0 references

Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations

0 references

An Approach to Fractional Programming via D.C. Constraints Problem: Local Search

0 references

0 references

0 references

0 references

A production-transportation problem with stochastic demand and concave production costs

0 references

Newton-Type Methods for Optimization and Variational Problems

0 references

A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes

0 references

A DC optimization-based clustering technique for edge detection

0 references

Convex image denoising via non-convex regularization with parameter selection

0 references

Exact penalty and error bounds in DC programming

0 references

Convergence of a splitting inertial proximal method for monotone operators

0 references

Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction

0 references

iPiano: Inertial Proximal Algorithm for Nonconvex Optimization

0 references

Computing B-Stationary Points of Nonsmooth DC Programs

0 references

Some methods of speeding up the convergence of iteration methods

0 references

Convex Analysis

0 references

Global convergence of a proximal linearized algorithm for difference of convex functions

0 references

On local search in d.c. optimization problems

0 references

Convex analysis approach to d. c. programming: Theory, algorithms and applications

0 references

0 references

Convex analysis and global optimization

0 references

Heavy-ball method in nonconvex optimization problems

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s11228-018-0497-0

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2281267

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2281267&oldid=37852359"