Pages that link to "Item:Q2413568"

The following pages link to Computing proximal points of convex functions with inexact subgradients (Q2413568):

Displaying 8 items.

• Computing proximal points of nonconvex functions (Q959941) (← links)
• Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness (Q1996734) (← links)
• Alternating forward-backward splitting for linearly constrained optimization problems (Q2191282) (← links)
• (Q4990492) (← links)
• The chain rule for VU-decompositions of nonsmooth functions (Q5110185) (← links)
• A derivative-free 𝒱𝒰-algorithm for convex finite-max problems (Q5113714) (← links)
• Linear convergence of the derivative-free proximal bundle method on convex nonsmooth functions, with application to the derivative-free \(\mathcal{VU}\)-algorithm (Q6564758) (← links)
• Proximal decomposition of convex optimization via an alternating linearization algorithm with inexact oracles (Q6593193) (← links)