Smooth minimization of non-smooth functions
From MaRDI portal
Recommendations
- Minimization methods for smooth nonconvex functions
- scientific article; zbMATH DE number 3892946
- Smoothing methods for nonsmooth, nonconvex minimization
- scientific article; zbMATH DE number 1148306
- Minimization of nonsmooth integral functionals
- Smoothing approximations to nonsmooth optimization problems
- Smooth nonlinear optimization of \(\mathbb R^n\)
- Nondifferentiable optimization by smooth approximations
- Smooth Optimization Methods for Minimax Problems
- scientific article; zbMATH DE number 4010220
Cites work
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Nonlinear rescaling vs. smoothing technique in convex optimization
- On convergence rates of subgradient optimization methods
Cited in
(only showing first 100 items - show all)- Accelerated gradient boosting
- scientific article; zbMATH DE number 3892946 (Why is no real title available?)
- Iteration-complexity of first-order penalty methods for convex programming
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
- smoothedLasso
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems
- Regularized non-local total variation and application in image restoration
- An adaptive accelerated first-order method for convex optimization
- Alternating direction method of multipliers for sparse principal component analysis
- Convex risk measures for portfolio optimization and concepts of flexibility
- iPiasco: inertial proximal algorithm for strongly convex optimization
- Operator splittings, Bregman methods and frame shrinkage in image processing
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- Matrix-free interior point method for compressed sensing problems
- Smooth nonlinear optimization of \(\mathbb R^n\)
- An optimal method for stochastic composite optimization
- Optimal subgradient methods: computational properties for large-scale linear inverse problems
- Clustering and feature selection using sparse principal component analysis
- Convex approximations to sparse PCA via Lagrangian duality
- Sparse occlusion detection with optical flow
- Analysis of a new variational model to restore point-like and curve-like singularities in imaging
- Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming
- Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs
- Image restoration with mixed or unknown noises
- Randomized first order algorithms with applications to \(\ell _{1}\)-minimization
- Approximation bounds for sparse principal component analysis
- Dual extrapolation and its applications to solving variational inequalities and related problems
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- Removing multiplicative noise by Douglas-Rachford splitting methods
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- Gradient consistency for integral-convolution smoothing functions
- Best subset selection via a modern optimization lens
- Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression
- Gradient methods for minimizing composite functions
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems
- Proximal splitting methods in signal processing
- Accelerated, parallel, and proximal coordinate descent
- A sparsity preserving stochastic gradient methods for sparse regression
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- Flexible low-rank statistical modeling with missing data and side information
- Proximal Methods for Sparse Optimal Scoring and Discriminant Analysis
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- An efficient augmented Lagrangian method with applications to total variation minimization
- Structured variable selection for regularized generalized canonical correlation analysis
- Efficient algorithms for robust and stable principal component pursuit problems
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
- Dual subgradient algorithms for large-scale nonsmooth learning problems
- Half-linear regularization for nonconvex image restoration models
- Linear coupling: an ultimate unification of gradient and mirror descent
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- A numerical exploration of compressed sampling recovery
- Fused multiple graphical lasso
- IMRO: A proximal quasi-Newton method for solving \(\ell_1\)-regularized least squares problems
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization
- First-order methods of smooth convex optimization with inexact oracle
- A majorization-minimization approach to the sparse generalized eigenvalue problem
- Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization
- Approximation schemes for materials with discontinuities
- Smoothing methods for nonsmooth, nonconvex minimization
- Templates for convex cone problems with applications to sparse signal recovery
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Alternating direction method for covariance selection models
- Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems
- Solving variational inequalities with stochastic mirror-prox algorithm
- Generalized system identification with stable spline kernels
- Multi-step fixed-point proximity algorithms for solving a class of optimization problems arising from image processing
- Testing the nullspace property using semidefinite programming
- Solving optimal stopping problems via empirical dual optimization
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Metric selection in fast dual forward-backward splitting
- A note on the complexity of proximal iterative hard thresholding algorithm
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Smoothing proximal gradient method for general structured sparse regression
- Weiszfeld's method: old and new results
- An implementable proximal point algorithmic framework for nuclear norm minimization
- The geometry of least squares in the 21st century
- Subgradient methods for huge-scale optimization problems
- Optimization in high dimensions via accelerated, parallel, and proximal coordinate descent
- Interior point methods 25 years later
- Primal-dual subgradient methods for convex problems
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- Minimization methods for smooth nonconvex functions
- Robust least square semidefinite programming with applications
- Universal gradient methods for convex optimization problems
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Random algorithms for convex minimization problems
- Super-resolution of positive sources: the discrete setup
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
- Regularized estimation and testing for high-dimensional multi-block vector-autoregressive models
- Accelerated training of max-margin Markov networks with kernels
- Domain adaptation and sample bias correction theory and algorithm for regression
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
- Homogeneous penalizers and constraints in convex image restoration
This page was built for publication: Smooth minimization of non-smooth functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q128676)
