Accelerating the DC algorithm for smooth functions

DOI10.1007/s10107-017-1180-1zbMath1461.65118arXiv1507.07375OpenAlexW2228305648WikidataQ59603223 ScholiaQ59603223MaRDI QIDQ1749446

Phan Tu Vuong, Ronan M. T. Fleming, Francisco J. Aragón Artacho

Publication date: 16 May 2018

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.07375

zbMATH Keywords

biochemical reaction networksDC functionDC optimization problemsŁojasiewicz property

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Systems biology, networks (92C42)

Related Items (29)

Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methods ⋮ The ABC of DC programming ⋮ DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ Conditions for duality between fluxes and concentrations in biochemical networks ⋮ Numerical comparisons of smoothing functions for optimal correction of an infeasible system of absolute value equations ⋮ \(l_{p}\)-norm regularization method (\( 0<p<1 \)) and DC programming for correction system of inconsistency linear inequalities ⋮ A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions ⋮ The boosted DC algorithm for linearly constrained DC programming ⋮ Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm ⋮ Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions ⋮ Finding robust minimizer for non-convex phase retrieval ⋮ The descent algorithm for solving the symmetric eigenvalue complementarity problem ⋮ A modified proximal point method for DC functions on Hadamard manifolds ⋮ A bundle-type method for nonsmooth DC programs ⋮ A refined inertial DC algorithm for DC programming ⋮ A Nonlocal Graph-PDE and Higher-Order Geometric Integration for Image Labeling ⋮ Sequential difference-of-convex programming ⋮ Optimal correction of infeasible equations system as Ax + B|x|= b using ℓ p-norm regularization ⋮ Open issues and recent advances in DC programming and DCA ⋮ An augmented subgradient method for minimizing nonsmooth DC functions ⋮ A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem ⋮ A bundle method for nonsmooth DC programming with application to chance-constrained problems ⋮ The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions ⋮ Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity ⋮ The modified second APG method for DC optimization problems ⋮ A general double-proximal gradient algorithm for d.c. programming ⋮ Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise ⋮ An extension of the proximal point algorithm beyond convexity ⋮ On strongly quasiconvex functions: existence results and proximal point algorithms

Cites Work

• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• Gradient methods for minimizing composite functions
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• On solving linear complementarity problems by DC programming and DCA
• A Barzilai-Borwein type method for stochastic linear complementarity problems
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• A minimization method for the sum of a convex function and a continuously differentiable function
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Globally convergent algorithms for finding zeros of duplomonotone mappings
• Numerical solution for optimization over the efficient set by d.c. optimization algorithms
• Proximal Newton-Type Methods for Minimizing Composite Functions
• A generalized proximal point algorithm for certain non-convex minimization problems
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Convergence of the Iterates of Descent Methods for Analytic Cost Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Accelerating the DC algorithm for smooth functions