Pages that link to "Item:Q312667"
From MaRDI portal
The following pages link to A dual method for minimizing a nonsmooth objective over one smooth inequality constraint (Q312667):
Displaying 5 items.
- The multiproximal linearization method for convex composite problems (Q2191762) (← links)
- A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems (Q2307749) (← 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)
- Foundations of Gauge and Perspective Duality (Q5376451) (← links)