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)- Solving \(k\)-center problems involving sets based on optimization techniques
- Finding geodesics joining given points
- Large-scale semidefinite programming via a saddle point mirror-prox algorithm
- Fast and Exact Leave-One-Out Analysis of Large-Margin Classifiers
- Accelerated training of max-margin Markov networks with kernels
- Domain adaptation and sample bias correction theory and algorithm for regression
- A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
- Accelerated residual methods for the iterative solution of systems of equations
- A general distributed dual coordinate optimization framework for regularized loss minimization
- From infinite to finite programs: explicit error bounds with applications to approximate dynamic programming
- Unifying mirror descent and dual averaging
- Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011
- Numerical computations of split Bregman method for fourth order total variation flow
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
- Half-linear regularization for nonconvex image restoration models
- On the proximal gradient algorithm with alternated inertia
- A family of subgradient-based methods for convex optimization problems in a unifying framework
- A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities
- No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization
- Radial duality. II: Applications and algorithms
- Multicommodity network flows: A survey. II: Solution methods
- Robust Accelerated Primal-Dual Methods for Computing Saddle Points
- Essentials of numerical nonsmooth optimization
- A smoothed augmented Lagrangian framework for convex optimization with nonsmooth constraints
- Fast optimization methods for high-dimensional row-sparse multivariate quantile linear regression
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- Parallel Nesterov domain decomposition method for elliptic partial differential equations
- Non-overlapping domain decomposition methods for dual total variation based image denoising
- Dynamic smoothness parameter for fast gradient methods
- Learnable descent algorithm for nonsmooth nonconvex image reconstruction
- Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing
- Optimal subgradient methods: computational properties for large-scale linear inverse problems
- scientific article; zbMATH DE number 7559070 (Why is no real title available?)
- First-order methods of smooth convex optimization with inexact oracle
- A note on the complexity of proximal iterative hard thresholding algorithm
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Shape-Constrained Kernel-Weighted Least Squares: Estimating Production Functions for Chilean Manufacturing Industries
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Interior point methods 25 years later
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- Smoothing gradient method for group-structured sparse feedback stabilization
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- An algebraic characterization of the optimum of regularized kernel methods
- Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization
- Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems
- Optimal methods for convex nested stochastic composite optimization
- An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems
- Log-exponential approximation in semi-infinite programming: a variational approach
- A hybrid quasi-Newton method with application in sparse recovery
- Analysis of the gradient method with an Armijo-Wolfe line search on a class of non-smooth convex functions
- Unsupervised meta-path selection for text similarity measure based on heterogeneous information networks
- Subgradient methods for huge-scale optimization problems
- Acceleration of primal-dual methods by preconditioning and simple subproblem procedures
- New primal-dual algorithms for a class of nonsmooth and nonlinear convex-concave minimax problems
- Efficient algorithms for distributionally robust stochastic optimization with discrete scenario support
- An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems
- On stochastic accelerated gradient with convergence rate of regression learning
- Compensated convexity and its applications
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- An optimal method for stochastic composite optimization
- On the \(O(1/t)\) convergence rate of the LQP prediction-correction method
- A class of distributed optimization methods with event-triggered communication
- Convergence and applications of novel FISTA-like algorithms
- How to select a solution in generalized Nash equilibrium problems
- Model-based multiple rigid object detection and registration in unstructured range data
- Smooth nonlinear optimization of \(\mathbb R^n\)
- Linear coupling: an ultimate unification of gradient and mirror descent
- An FFT-based fast gradient method for elastic and inelastic unit cell homogenization problems
- Accelerated Bregman Primal-Dual Methods Applied to Optimal Transport and Wasserstein Barycenter Problems
- Dual subgradient algorithms for large-scale nonsmooth learning problems
- Automated parameter selection in the ${L}^{1} \mbox{-} {L}^{2}$-TV model for removing Gaussian plus impulse noise
- Lama-Net: a convergent network architecture for dual-domain reconstruction
- An entropy regularization technique for minimizing a sum of Tchebycheff norms
- Robust Schatten-p norm based approach for tensor completion
- Network manipulation algorithm based on inexact alternating minimization
- On stochastic accelerated gradient with convergence rate
- Generalized self-concordant functions: a recipe for Newton-type methods
- Chance-constrained programs with convex underlying functions: a bilevel convex optimization perspective
- General procedure to provide high-probability guarantees for stochastic saddle point problems
- An efficient augmented Lagrangian method with applications to total variation minimization
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems
- An adaptive accelerated first-order method for convex optimization
- Soft clustering by convex electoral model
- Smoothing techniques and difference of convex functions algorithms for image reconstructions
- A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM
- Stochastic incremental mirror descent algorithms with Nesterov smoothing
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- Primal-dual splitting method for high-order model with application to image restoration
- Super-resolution of positive sources: the discrete setup
- Online first-order framework for robust convex optimization
- 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
- Fast First-Order Algorithms for Packing–Covering Semidefinite Programs
- Solving variational inequalities with stochastic mirror-prox algorithm
- Explainable bilevel optimization: an application to the Helsinki Deblur Challenge
- Total Variation in Imaging
- Flexible low-rank statistical modeling with missing data and side information
- A cyclic projected gradient method
- A smooth primal-dual optimization framework for nonsmooth composite convex minimization
- Generalized conditional gradient for sparse estimation
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)
