Benchmark of some nonsmooth optimization solvers for computing nonconvex proximal points

MaRDI QIDQ3412066zbMATH OpenFDO

Authors

Publication date 5 December 2006

zbMATH Keywords

nonconvex optimization, proximal point, algorithm benchmarking

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• Computing proximal points of nonconvex functions
• Epsilon-proximal point algorithms for nondifferentiable convex optimization problems and applications
• Proximal point methods and nonconvex optimization
• A proximal bundle method for nonsmooth nonconvex functions with inexact information
• Proximal point method for a special class of nonconvex multiobjective optimization functions

Cited in

(3)

• Best practices for comparing optimization algorithms
• Optimality, identifiability, and sensitivity
• Mean-based Borda count for paradox-free comparisons of optimization algorithms

This page was built for publication: Benchmark of some nonsmooth optimization solvers for computing nonconvex proximal points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3412066)