A new proximal algorithm for unconstrained nonconvex optimization problems

DOI10.13338/J.ISSN.1006-8341.2018.01.010MaRDI QIDQ4687818zbMATH OpenFDO

Authors Chengyu Wu, Rudong Chen

Publication date 22 October 2018

Full work available at URL https://doi.org/10.13338/J.ISSN.1006-8341.2018.01.010

zbMATH Keywords

convergence rateKurdyka-Lojasiewicz propertyproximal algorithmunconstrained nonconvex optimization problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• Convergence analysis of a proximal point algorithm for minimizing differences of functions
• Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
• A new boosted proximal point algorithm for minimizing nonsmooth DC functions
• A new alternating direction method for linearly constrained nonconvex optimization problems
• Nonconvex approximations in unconstrained minimization

Cited in

(3)

• A preconditioning proximal Newton method for nondifferentiable convex optimization
• An inexact proximal regularization method for unconstrained optimization
• A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems

This page was built for publication: A new proximal algorithm for unconstrained nonconvex optimization problems

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