scientific article
From MaRDI portal
Publication:3410053
zbMath1104.65058MaRDI QIDQ3410053
Abdellatif Moudafi, Paul-Emile Maingé
Publication date: 21 November 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
convergencenumerical examplescritical pointssubdifferentialsproximal mappingsapproximate proximal methodDC minimization
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items
Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions ⋮ On difference of two monotone operators ⋮ Global convergence of a proximal linearized algorithm for difference of convex functions ⋮ A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem ⋮ General variational inclusions involving difference of operators ⋮ A proximal point algorithm for DC functions on Hadamard manifolds ⋮ Characterization and recognition of d.c. functions ⋮ Characterization of d.c. Functions in terms of quasidifferentials ⋮ Computing B-Stationary Points of Nonsmooth DC Programs ⋮ On the difference of two maximal monotone operators: Regularization and algorithmic approaches ⋮ Accelerating the DC algorithm for smooth functions ⋮ Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels ⋮ On critical points of the difference of two maximal monotone operators ⋮ The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions ⋮ An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels ⋮ Copositivity meets D. C. optimization
This page was built for publication:
