Pages that link to "Item:Q2191762"
From MaRDI portal
The following pages link to The multiproximal linearization method for convex composite problems (Q2191762):
Displaying 13 items.
- A proximal-based deomposition method for compositions method for convex minimization problems (Q1330895) (← links)
- An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization (Q2062324) (← links)
- Primal superlinear convergence of SQP methods in piecewise linear-quadratic composite optimization (Q2116019) (← links)
- Efficiency of minimizing compositions of convex functions and smooth maps (Q2330660) (← links)
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems (Q2350862) (← links)
- A parallel line search subspace correction method for composite convex optimization (Q2516372) (← links)
- Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications (Q2694483) (← links)
- Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization (Q4997175) (← 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)
- PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS (Q5284943) (← links)
- High-Order Optimization Methods for Fully Composite Problems (Q5869820) (← links)
- Harnessing Structure in Composite Nonsmooth Minimization (Q6046827) (← links)
- Efficiency of higher-order algorithms for minimizing composite functions (Q6155068) (← links)
