Pages that link to "Item:Q1709968"

The following pages link to The value function approach to convergence analysis in composite optimization (Q1709968):

Displaying 11 items.

• From error bounds to the complexity of first-order descent methods for convex functions (Q1675251) (← links)
• Proximal methods avoid active strict saddles of weakly convex functions (Q2143222) (← links)
• Global convergence of model function based Bregman proximal minimization algorithms (Q2154449) (← links)
• The multiproximal linearization method for convex composite problems (Q2191762) (← links)
• Efficiency of minimizing compositions of convex functions and smooth maps (Q2330660) (← links)
• (Q3550045) (← links)
• Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems (Q5010048) (← links)
• Composite Optimization by Nonconvex Majorization-Minimization (Q5230420) (← links)
• Stochastic proximal linear method for structured non-convex problems (Q5858986) (← links)
• Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions (Q6071886) (← links)
• Efficiency of higher-order algorithms for minimizing composite functions (Q6155068) (← links)