Pages that link to "Item:Q128676"
From MaRDI portal
The following pages link to Smooth minimization of non-smooth functions (Q128676):
Displaying 50 items.
- Robust Schatten-\(p\) norm based approach for tensor completion (Q2291931) (← links)
- An accelerated version of alternating direction method of multipliers for TV minimization in EIT (Q2293764) (← links)
- On sparse beamformer design with reverberation (Q2295315) (← links)
- Accelerated proximal incremental algorithm schemes for non-strongly convex functions (Q2297863) (← links)
- Solving \(k\)-center problems involving sets based on optimization techniques (Q2301186) (← links)
- A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems (Q2307749) (← links)
- An FFT-based fast gradient method for elastic and inelastic unit cell homogenization problems (Q2308941) (← links)
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity (Q2311123) (← links)
- Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems (Q2313241) (← links)
- Universal method of searching for equilibria and stochastic equilibria in transportation networks (Q2314190) (← links)
- Optimal subgradient methods: computational properties for large-scale linear inverse problems (Q2315075) (← links)
- Exploiting problem structure in optimization under uncertainty via online convex optimization (Q2316616) (← links)
- Accelerated augmented Lagrangian method for total variation minimization (Q2322436) (← links)
- Generalized self-concordant functions: a recipe for Newton-type methods (Q2330645) (← links)
- Efficiency of minimizing compositions of convex functions and smooth maps (Q2330660) (← links)
- A relax inexact accelerated proximal gradient method for the constrained minimization problem of maximum eigenvalue functions (Q2336689) (← links)
- Generalized affine scaling algorithms for linear programming problems (Q2337378) (← links)
- An efficient primal dual prox method for non-smooth optimization (Q2339936) (← links)
- Proximal iterative Gaussian smoothing algorithm for a class of nonsmooth convex minimization problems (Q2340166) (← links)
- A characterization theorem and an algorithm for a convex hull problem (Q2341220) (← links)
- A variable smoothing algorithm for solving convex optimization problems (Q2343070) (← links)
- Multi-step fixed-point proximity algorithms for solving a class of optimization problems arising from image processing (Q2348695) (← links)
- An algorithm for total variation regularized photoacoustic imaging (Q2348696) (← links)
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems (Q2350862) (← links)
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization (Q2352420) (← links)
- On efficient randomized algorithms for finding the PageRank vector (Q2354453) (← links)
- On the efficiency of a randomized mirror descent algorithm in online optimization problems (Q2354481) (← links)
- Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems (Q2374363) (← links)
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization (Q2374365) (← links)
- A primal-dual active-set algorithm for bilaterally constrained total variation deblurring and piecewise constant Mumford-Shah segmentation problems (Q2391085) (← links)
- Certification aspects of the fast gradient method for solving the dual of parametric convex programs (Q2392808) (← links)
- Fast gradient descent method for mean-CVaR optimization (Q2393350) (← links)
- Minimizing differences of convex functions with applications to facility location and clustering (Q2401517) (← links)
- LAVIR -- locally adaptive variational image registration (Q2401990) (← links)
- Accelerated Bregman operator splitting with backtracking (Q2408418) (← links)
- Combining fast inertial dynamics for convex optimization with Tikhonov regularization (Q2408626) (← links)
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization (Q2408897) (← links)
- An accelerated proximal augmented Lagrangian method and its application in compressive sensing (Q2412861) (← links)
- Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity (Q2413084) (← links)
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence (Q2414908) (← links)
- An optimal subgradient algorithm with subspace search for costly convex optimization problems (Q2415906) (← links)
- Selective bi-coordinate method for limit non-smooth resource allocation type problems (Q2416621) (← links)
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization (Q2419544) (← links)
- PAL-Hom method for QP and an application to LP (Q2419548) (← links)
- A simple convergence analysis of Bregman proximal gradient algorithm (Q2419573) (← links)
- Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization (Q2420797) (← links)
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization (Q2422878) (← links)
- Partial convolution for total variation deblurring and denoising by new linearized alternating direction method of multipliers with extension step (Q2423277) (← links)
- Efficient, certifiably optimal clustering with applications to latent variable graphical models (Q2425167) (← links)
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems (Q2425176) (← links)
