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):
Displaying 16 items.
- Nonsmoothness in machine learning: specific structure, proximal identification, and applications (Q829492) (← links)
- 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)
- Dualize, split, randomize: toward fast nonsmooth optimization algorithms (Q2082232) (← links)
- A two-step fixed-point proximity algorithm for a class of non-differentiable optimization models in machine learning (Q2333729) (← links)
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization (Q2425169) (← 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)
- Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates (Q4971027) (← links)
- Running Primal-Dual Gradient Method for Time-Varying Nonconvex Problems (Q5093264) (← links)
- A Smooth Double Proximal Primal-Dual Algorithm for a Class of Distributed Nonsmooth Optimization Problems (Q5125604) (← 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)
- Online composite optimization with time-varying regularizers (Q6559338) (← links)
