Some brief observations in minimizing the sum of locally Lipschitzian functions

DOI10.1007/S11590-019-01477-YMaRDI QIDQ2174893zbMATH OpenOpenAlexWikidataFDO

Authors Wim van Ackooij, Welington de Oliveira

Publication date 27 April 2020

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-019-01477-y

zbMATH Keywords

locally Lipschitzian functionsnonlinear optimizationnonsmooth optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• Minimization of Locally Lipschitzian Functions
• On minimization of locally Lipschitzian functions
• An algorithm for minimizing a class of locally Lipschitz functions
• An effective nonsmooth optimization algorithm for locally Lipschitz functions
• scientific article; zbMATH DE number 940912

Cites work

• A simplified view of first order methods for optimization
• A Smooth Variational Principle With Applications to Subdifferentiability and to Differentiability of Convex Functions
• An inertial algorithm for DC programming
• Computing B-stationary points of nonsmooth DC programs
• Convergence analysis of difference-of-convex algorithm with subanalytic data
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• DC programming and DCA for general DC programs
• DC programming and DCA: thirty years of developments
• Exact penalty and error bounds in DC programming
• Exact penalty in d. c. programming
• scientific article; zbMATH DE number 4032473 (Why is no real title available?)
• scientific article; zbMATH DE number 4041643 (Why is no real title available?)
• Introductory lectures on convex optimization. A basic course.
• Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
• On Fréchet subdifferentials
• Proximal bundle methods for nonsmooth DC programming
• Techniques of variational analysis
• Transactions on Computational Collective Intelligence XIII
• Variational analysis and applications

Cited in

(7)

• A SIMPLE DERIVATION OF SUFFICIENT CONDITIONS FOR A LOCAL MINIMUM OF A LIPSCHITZIAN FUNCTION
• Iteration Functions in Some Nonsmooth Optimization Algorithms
• scientific article; zbMATH DE number 864910 (Why is no real title available?)
• Algorithmic Applications in Management
• Weak convexity and approximate subdifferentials
• A proximal splitting algorithm for generalized DC programming with applications in signal recovery
• A proximal-type method for nonsmooth and nonconvex constrained minimization problems

This page was built for publication: Some brief observations in minimizing the sum of locally Lipschitzian functions

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