Pages that link to "Item:Q2339936"
From MaRDI portal
The following pages link to An efficient primal dual prox method for non-smooth optimization (Q2339936):
Displayed 8 items.
- Approximately nearest neighborhood image search using unsupervised hashing via homogeneous kernels (Q1649549) (← links)
- The nearest polynomial to multiple given polynomials with a given zero: a unified optimization approach (Q1985438) (← links)
- Point process estimation with Mirror Prox algorithms (Q2019904) (← links)
- Efficient computation of the nearest polynomial by linearized alternating direction method (Q2663820) (← links)
- RSG: Beating Subgradient Method without Smoothness and Strong Convexity (Q4558142) (← links)
- (Q5159451) (← links)
- Accelerate stochastic subgradient method by leveraging local growth condition (Q5236746) (← links)
- An asynchronous subgradient-proximal method for solving additive convex optimization problems (Q6093360) (← links)