Pages that link to "Item:Q128676"
From MaRDI portal
The following pages link to Smooth minimization of non-smooth functions (Q128676):
Displaying 50 items.
- Dual extrapolation and its applications to solving variational inequalities and related problems (Q868471) (← links)
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras (Q875019) (← links)
- Smoothing technique and its applications in semidefinite optimization (Q879964) (← links)
- An inertial forward-backward algorithm for monotone inclusions (Q890044) (← links)
- iPiasco: inertial proximal algorithm for strongly convex optimization (Q890114) (← links)
- A proximal alternating linearization method for minimizing the sum of two convex functions (Q892779) (← links)
- Metric selection in fast dual forward-backward splitting (Q901087) (← links)
- AAR-based decomposition algorithm for non-linear convex optimisation (Q902092) (← links)
- Construction, management, and performance of sparse Markowitz portfolios (Q905387) (← links)
- Compensated convexity and its applications (Q935274) (← links)
- An entropy regularization technique for minimizing a sum of Tchebycheff norms (Q969313) (← links)
- Tetrolet shrinkage with anisotropic total variation minimization for image approximation (Q985618) (← links)
- Some first-order algorithms for total variation based image restoration (Q993538) (← links)
- Removing multiplicative noise by Douglas-Rachford splitting methods (Q993562) (← links)
- Mathematical modeling of textures: application to color image decomposition with a projected gradient algorithm (Q993581) (← links)
- An algebraic characterization of the optimum of regularized kernel methods (Q1009329) (← links)
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems (Q1016355) (← links)
- smoothedLasso (Q1353652) (← links)
- Smooth nonlinear optimization of \(\mathbb R^n\) (Q1374463) (← links)
- A joint convex penalty for inverse covariance matrix estimation (Q1623469) (← links)
- Linearized alternating direction method of multipliers for sparse group and fused Lasso models (Q1623671) (← links)
- New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure (Q1659678) (← links)
- Sparse estimation of high-dimensional correlation matrices (Q1660228) (← links)
- Supervised nonnegative matrix factorization via minimization of regularized Moreau-envelope of divergence function with application to music transcription (Q1661478) (← links)
- Finding Dantzig selectors with a proximity operator based fixed-point algorithm (Q1663200) (← links)
- A new fast algorithm for constrained four-directional total variation image denoising problem (Q1666647) (← links)
- Accelerated schemes for a class of variational inequalities (Q1680963) (← links)
- The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector (Q1686207) (← links)
- A dual gradient-projection algorithm for model predictive control in fixed-point arithmetic (Q1689378) (← links)
- Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery (Q1701931) (← links)
- Regularized non-local total variation and application in image restoration (Q1703956) (← links)
- Acceleration of the PDHGM on partially strongly convex functions (Q1703999) (← links)
- Parallel multi-block ADMM with \(o(1/k)\) convergence (Q1704845) (← links)
- Accelerated first-order methods for hyperbolic programming (Q1717219) (← links)
- Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing (Q1724067) (← links)
- How to select a solution in generalized Nash equilibrium problems (Q1730840) (← links)
- Level-set methods for convex optimization (Q1739042) (← links)
- Efficient histogram dictionary learning for text/image modeling and classification (Q1741297) (← links)
- Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates (Q1744900) (← links)
- Universal method for stochastic composite optimization problems (Q1746349) (← links)
- A mixture of nuclear norm and matrix factorization for tensor completion (Q1747028) (← links)
- Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering (Q1749775) (← links)
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352) (← links)
- On the proximal gradient algorithm with alternated inertia (Q1752647) (← links)
- Functional response regression analysis (Q1755123) (← links)
- A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique (Q1756799) (← links)
- Templates for convex cone problems with applications to sparse signal recovery (Q1762456) (← links)
- An optimal randomized incremental gradient method (Q1785198) (← links)