Smoothing and first order methods: a unified framework
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4092056
- scientific article; zbMATH DE number 3858356
- Smoothing splines. Methods and applications
- scientific article; zbMATH DE number 1455128
- Relatively smooth convex optimization by first-order methods, and applications
- Nonlinear smoothing and the EM algorithm for positive integral equations of the first kind
- A first-order smoothing technique for a class of large-scale linear programs
- Linear methods in some smoothing problems
- Smoothing techniques for exact penalty methods
Cited in
(91)- A convex analysis approach to optimal controls with switching structure for partial differential equations
- A family of subgradient-based methods for convex optimization problems in a unifying framework
- No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization
- Radial duality. II: Applications and algorithms
- A smoothed augmented Lagrangian framework for convex optimization with nonsmooth constraints
- Dynamic smoothness parameter for fast gradient methods
- First-order methods of smooth convex optimization with inexact oracle
- A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization
- Network manipulation algorithm based on inexact alternating minimization
- Alternating structure-adapted proximal gradient descent for nonconvex nonsmooth block-regularized problems
- Smoothing techniques and difference of convex functions algorithms for image reconstructions
- Stochastic incremental mirror descent algorithms with Nesterov smoothing
- A preconditioner for a primal-dual Newton conjugate gradient method for compressed sensing problems
- Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs
- A smooth primal-dual optimization framework for nonsmooth composite convex minimization
- Efficient projection-free online convex optimization using stochastic gradients
- scientific article; zbMATH DE number 7255066 (Why is no real title available?)
- An inexact variable metric proximal point algorithm for generic quasi-Newton acceleration
- First-order methods for convex optimization
- A level-set method for convex optimization with a feasible solution path
- On the convergence rate of scaled gradient projection method
- Neural network based on systematically generated smoothing functions for absolute value equation
- Bilevel Optimization of Regularization Hyperparameters in Machine Learning
- Linear convergence of Frank-Wolfe for rank-one matrix recovery without strong convexity
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- A multilevel proximal gradient algorithm for a class of composite optimization problems
- One-Step Estimation with Scaled Proximal Methods
- scientific article; zbMATH DE number 7626760 (Why is no real title available?)
- IML FISTA: a multilevel framework for inexact and inertial forward-backward. Application to image restoration
- A first order method for solving convex bilevel optimization problems
- A new homotopy proximal variable-metric framework for composite convex minimization
- Gradient consistency for integral-convolution smoothing functions
- An adaptive primal-dual framework for nonsmooth convex minimization
- A Nonlocal Graph-PDE and Higher-Order Geometric Integration for Image Labeling
- Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method
- Helping you finding an appropriate regularization process
- An accelerated coordinate gradient descent algorithm for non-separable composite optimization
- Sharpness, restart, and acceleration
- scientific article; zbMATH DE number 7370566 (Why is no real title available?)
- A dual reformulation and solution framework for regularized convex clustering problems
- An augmented Lagrangian method for nonconvex composite optimization problems with nonlinear constraints
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
- New results on subgradient methods for strongly convex optimization problems with a unified analysis
- An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems
- A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming
- A simplified view of first order methods for optimization
- A framework to efficiently smooth L₁ penalties for linear regression
- Efficiency of minimizing compositions of convex functions and smooth maps
- Differentiable neural network representation of multi-well, locally-convex potentials
- Polar convolution
- On the metric resolvent: nonexpansiveness, convergence rates and applications
- Inexact FISTA-like methods with adaptive backtracking
- Optimization on a finer scale: bounded local subgradient variation perspective
- A new fast algorithm for constrained four-directional total variation image denoising problem
- Weiszfeld's method: old and new results
- A simple nearly optimal restart scheme for speeding up first-order methods
- A simple convergence analysis of Bregman proximal gradient algorithm
- Smoothing functions for sparse optimization: a unified framework
- MARS as an alternative approach of Gaussian graphical model for biochemical networks
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- Moreau envelope and proximal-point methods under the lens of high-order regularization
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
- An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization
- Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions
- A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems
- Fully smoothed _1-TV models: bounds for the minimizers and parameter choice
- Superquantiles at work: machine learning applications and efficient subgradient computation
- A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
- Exact Lipschitz regularization of convex optimization problems
- The distributionally robust chance-constrained vehicle routing problem
- Accelerated proximal incremental algorithm schemes for non-strongly convex functions
- Two-metric variable scaled splitting algorithm for nonsmooth nonconvex sparsity-penalized quantile regression
- Consistent approximations in composite optimization
- Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization
- scientific article; zbMATH DE number 7632133 (Why is no real title available?)
- Theory and fast learned solver for ^1-TV regularization
- Adversarial classification via distributional robustness with Wasserstein ambiguity
- Selective bi-coordinate method for limit non-smooth resource allocation type problems
- MAGMA: multilevel accelerated gradient mirror descent algorithm for large-scale convex composite minimization
- Smoothed _1-regularization-based line search for sparse signal recovery
- Acceleration of the PDHGM on partially strongly convex functions
- A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem
- A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds
- New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure
- A randomized coordinate descent method with volume sampling
- A variable smoothing algorithm for solving convex optimization problems
- FOM -- a MATLAB toolbox of first-order methods for solving convex optimization problems
- Adaptive smoothing algorithms for nonsmooth composite convex minimization
- Accelerated first-order methods for hyperbolic programming
- Epi-convergence properties of smoothing by infimal convolution
This page was built for publication: Smoothing and first order methods: a unified framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2910884)
