scientific article; zbMATH DE number 2076851

zbMath1107.90427MaRDI QIDQ4470269

M. A. B. Candido, Raimundo J. B. de Sampaio, Wen-Yu Sun

Publication date: 22 June 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Related Items

Hybrid proximal linearized algorithm for the split DC program in infinite-dimensional real Hilbert spaces ⋮ Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions ⋮ Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints ⋮ 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 ⋮ A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes ⋮ Computing proximal points of convex functions with inexact subgradients ⋮ A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions ⋮ A modified proximal point method for DC functions on Hadamard manifolds ⋮ A proximal point algorithm for DC functions on Hadamard manifolds ⋮ Open issues and recent advances in DC programming and DCA ⋮ Characterization and recognition of d.c. functions ⋮ Characterization of d.c. Functions in terms of quasidifferentials ⋮ An augmented subgradient method for minimizing nonsmooth DC functions ⋮ DC programming and DCA: thirty years of developments ⋮ A general nonconvex multiduality principle ⋮ Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness ⋮ On 1-Laplacian elliptic equations modeling magnetic resonance image Rician denoising ⋮ 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 ⋮ A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems ⋮ On Algorithms for Difference of Monotone Operators ⋮ On Algorithms for Difference of Monotone Operators ⋮ An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels ⋮ Split proximal linearized algorithm and convergence theorems for the split DC program ⋮ Copositivity meets D. C. optimization ⋮ Global optimization from concave minimization to concave mixed variational inequality ⋮ A forward-backward algorithm for the DC programming in Hilbert spaces ⋮ A general double-proximal gradient algorithm for d.c. programming ⋮ Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise

This page was built for publication: