Weak convexity and approximate subdifferentials
From MaRDI portal
Publication:6644255
DOI10.1007/S10957-024-02551-XMaRDI QIDQ6644255
Claudia Sagastizábal, Author name not available (Why is that?), Wim van Ackooij
Publication date: 27 November 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on epsilon-subgradients and maximal monotonicity
- Optimization of upper semidifferentiable functions
- The ABC of DC programming
- Properties of generalized differentials
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Convergence of some algorithms for convex minimization
- Hunting for a smaller convex subdifferential
- On Fréchet subdifferentials
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Linear convergence of epsilon-subgradient descent methods for a class of convex functions
- Some brief observations in minimizing the sum of locally Lipschitzian functions
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- Lipschitz $r$-continuity of the approximative subdifferential of a convex function.
- Nonconvex minimization problems
- A formula on the approximate subdifferential of the difference of convex functions
- Optimization of lipschitz continuous functions
- ε-Subdifferential and ε-monotonicity
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
This page was built for publication: Weak convexity and approximate subdifferentials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644255)
