Pages that link to "Item:Q128676"
From MaRDI portal
The following pages link to Smooth minimization of non-smooth functions (Q128676):
Displaying 50 items.
- Graph Topology Invariant Gradient and Sampling Complexity for Decentralized and Stochastic Optimization (Q6116247) (← links)
- A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities (Q6126602) (← links)
- Radial duality. II: Applications and algorithms (Q6126645) (← links)
- No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization (Q6126650) (← links)
- Robust Accelerated Primal-Dual Methods for Computing Saddle Points (Q6130545) (← links)
- A two-stage stochastic variational inequality model for storage and dynamic distribution of medical supplies in epidemic management (Q6135624) (← links)
- A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM (Q6142230) (← links)
- Stochastic incremental mirror descent algorithms with Nesterov smoothing (Q6145577) (← links)
- Semiconductor superlattice physical unclonable function based two-dimensional compressive sensing cryptosystem and its application to image encryption (Q6150439) (← links)
- Efficiency of higher-order algorithms for minimizing composite functions (Q6155068) (← links)
- Smooth monotone stochastic variational inequalities and saddle point problems: a survey (Q6160072) (← links)
- Convergence rate analysis of the multiplicative gradient method for PET-type problems (Q6161276) (← links)
- Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming (Q6161315) (← links)
- Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability (Q6161546) (← links)
- A non-convex piecewise quadratic approximation of \(\ell_0\) regularization: theory and accelerated algorithm (Q6162509) (← links)
- A generalized Frank-Wolfe method with ``dual averaging'' for strongly convex composite optimization (Q6164957) (← links)
- A reduced half thresholding algorithm (Q6164988) (← links)
- Faster first-order primal-dual methods for linear programming using restarts and sharpness (Q6165583) (← links)
- Consistent approximations in composite optimization (Q6165588) (← links)
- Quadratic error bound of the smoothed gap and the restarted averaged primal-dual hybrid gradient (Q6168888) (← links)
- Explainable bilevel optimization: an application to the Helsinki Deblur Challenge (Q6169501) (← links)
- First-order methods for convex optimization (Q6169988) (← links)
- The forward-backward envelope for sampling with the overdamped Langevin algorithm (Q6173566) (← links)
- PCA Sparsified (Q6176425) (← links)
- From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems (Q6179877) (← links)
- An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems (Q6182323) (← links)
- Lagrangian and Hamiltonian dynamics for probabilities on the statistical bundle (Q6191594) (← links)
- Gradient complexity and non-stationary views of differentially private empirical risk minimization (Q6199392) (← links)
- An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost (Q6200957) (← links)
- Gradient regularization of Newton method with Bregman distances (Q6201850) (← links)
- Plug-and-play algorithms for convex non-convex regularization: convergence analysis and applications (Q6496103) (← links)
- Coordinate descent methods beyond smoothness and separability (Q6498410) (← links)
- A new proximal heavy ball inexact line-search algorithm (Q6541375) (← links)
- Variance reduced moving balls approximation method for smooth constrained minimization problems (Q6542460) (← links)
- Fast optimization methods for high-dimensional row-sparse multivariate quantile linear regression (Q6552935) (← links)
- Chance-constrained programs with convex underlying functions: a bilevel convex optimization perspective (Q6568925) (← links)
- General procedure to provide high-probability guarantees for stochastic saddle point problems (Q6569676) (← links)
- Iterative distributed model predictive control for nonlinear systems with coupled non-convex constraints and costs (Q6577235) (← links)
- Smoothing algorithms for nonsmooth optimization over the Stiefel manifold with applications to the graph Fourier basis problem (Q6580208) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
- A new computational framework for log-concave density estimation (Q6590464) (← links)
- An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints (Q6593830) (← links)
- Set-limited functions and polynomial-time interior-point methods (Q6596326) (← links)
- Optimality conditions and numerical algorithms for a class of linearly constrained minimax optimization problems (Q6601202) (← links)
- A survey of numerical algorithms that can solve the Lasso problems (Q6602016) (← links)
- Variational model-based deep neural networks for image reconstruction (Q6606462) (← links)
- Provably convergent learned inexact descent algorithm for low-dose CT reconstruction (Q6608115) (← links)
- Exterior-point optimization for sparse and low-rank optimization (Q6608755) (← links)
- Approximation of splines in Wasserstein spaces (Q6621507) (← links)
- Shape-Constrained Kernel-Weighted Least Squares: Estimating Production Functions for Chilean Manufacturing Industries (Q6626283) (← links)
