An inertial algorithm for DC programming

DOI10.1007/S11228-018-0497-0zbMath1434.90151OpenAlexW2898522262WikidataQ129077403 ScholiaQ129077403MaRDI QIDQ2281267

Welington de Oliveira, Michel P. Tcheou

Publication date: 19 December 2019

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11228-018-0497-0

zbMATH Keywords

nonsmooth optimizationvariational analysisDC programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Optimality conditions (49K99)

Related Items (23)

The ABC of DC programming ⋮ A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning ⋮ DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ Classification in the multiple instance learning framework via spherical separation ⋮ Some brief observations in minimizing the sum of locally Lipschitzian functions ⋮ The boosted DC algorithm for linearly constrained DC programming ⋮ Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm ⋮ Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints ⋮ A refined inertial DC algorithm for DC programming ⋮ A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program ⋮ Sequential difference-of-convex programming ⋮ Open issues and recent advances in DC programming and DCA ⋮ An inertial proximal point method for difference of maximal monotone vector fields in Hadamard manifolds ⋮ An augmented subgradient method for minimizing nonsmooth DC functions ⋮ A boosted DC algorithm for non-differentiable DC components with non-monotone line search ⋮ A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem ⋮ A bundle method for nonsmooth DC programming with application to chance-constrained problems ⋮ A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs ⋮ On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials ⋮ A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging ⋮ The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions ⋮ Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions ⋮ Revisiting augmented Lagrangian duals

Uses Software

• iPiano

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On local search in d.c. optimization problems
• Global convergence of a proximal linearized algorithm for difference of convex functions
• Convex image denoising via non-convex regularization with parameter selection
• A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
• Exact penalty and error bounds in DC programming
• A DC optimization-based clustering technique for edge detection
• A production-transportation problem with stochastic demand and concave production costs
• Convergence of some algorithms for convex minimization
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Convergence of a splitting inertial proximal method for monotone operators
• Proximal bundle methods for nonsmooth DC programming
• On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
• A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
• A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
• iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
• Computing B-Stationary Points of Nonsmooth DC Programs
• An Approach to Fractional Programming via D.C. Constraints Problem: Local Search
• Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
• Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
• Fast Image Recovery Using Variable Splitting and Constrained Optimization
• Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
• Newton-Type Methods for Optimization and Variational Problems
• Some methods of speeding up the convergence of iteration methods
• Convex Analysis
• Convex analysis and global optimization
• An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
• Benchmarking optimization software with performance profiles.
• Heavy-ball method in nonconvex optimization problems

This page was built for publication: An inertial algorithm for DC programming