Pages that link to "Item:Q2158107"
From MaRDI portal
The following pages link to The developments of proximal point algorithms (Q2158107):
Displaying 12 items.
- An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems (Q2088791) (← links)
- How good are the proximal point algorithms? (Q3777808) (← links)
- On the linear convergence of a Bregman proximal point algorithm (Q5088831) (← links)
- (Q5861875) (← links)
- A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity (Q6078423) (← links)
- Sparse broadband beamformer design via proximal optimization Techniques (Q6085622) (← links)
- Understanding the convergence of the preconditioned PDHG method: a view of indefinite proximal ADMM (Q6158982) (← links)
- A partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problems (Q6184273) (← links)
- Stochastic Gauss-Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks (Q6540474) (← links)
- Customized Douglas-Rachford splitting methods for structured inverse variational inequality problems (Q6586907) (← links)
- A customized inertial proximal alternating minimization for SVD-free robust principal component analysis (Q6606306) (← links)
- Several kinds of acceleration techniques for unconstrained optimization first-order algorithms (Q6665360) (← links)
