Pages that link to "Item:Q2790892"
From MaRDI portal
The following pages link to A proximal multiplier method for separable convex minimization (Q2790892):
Displaying 16 items.
- Proximal-based pre-correction decomposition methods for structured convex minimization problems (Q489115) (← links)
- Lagrangian penalization scheme with parallel forward-backward splitting (Q725876) (← links)
- A proximal augmented method for semidefinite programming problems (Q2048441) (← links)
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces (Q2141725) (← links)
- The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints (Q2315259) (← links)
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems (Q2350862) (← links)
- Rescaling and stepsize selection in proximal methods using separable generalized distances (Q2784410) (← links)
- Convergence rate of a proximal multiplier algorithm for separable convex minimization (Q2970394) (← links)
- (Q2984432) (← links)
- A proximal splitting method for separable convex programming and its application to compressive sensing (Q3455368) (← links)
- (Q4241608) (← links)
- (Q5042653) (← links)
- PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS (Q5284943) (← links)
- Splitting proximal with penalization schemes for additive convex hierarchical minimization problems (Q5858997) (← links)
- Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization (Q5959328) (← links)
- An interior proximal method with proximal distances for quasimonotone equilibrium problems (Q6629011) (← links)
