An effective optimization algorithm for locally nonconvex Lipschitz functions based on mollifier subgradients

MaRDI QIDQ648482zbMATH OpenFDO

Authors Nezam Mahdavi-Amiri, Rohollah Yousefpour

Publication date 22 November 2011

Published in Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

Monte-Carlo methodClarke generalized gradientdynamic algorithmlocally nonconvex Lipschitz functionmollifier subgradient

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Recommendations

• An effective nonsmooth optimization algorithm for locally Lipschitz functions
• scientific article; zbMATH DE number 22691
• An efficient descent method for locally Lipschitz multiobjective optimization problems
• An algorithm for minimizing a class of locally Lipschitz functions
• scientific article; zbMATH DE number 5953654
• -subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
• Local convexification of the Lagrangian function for nonlinear nonconvex optimization
• scientific article; zbMATH DE number 433002
• A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization
• Approximate solutions in nonsmooth robust optimization with locally Lipschitz constraints

Cited in

(1)

• An effective nonsmooth optimization algorithm for locally Lipschitz functions

Describes a project that uses

Uses Software

• Matlab

This page was built for publication: An effective optimization algorithm for locally nonconvex Lipschitz functions based on mollifier subgradients

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