Pages that link to "Item:Q128676"

The following pages link to Smooth minimization of non-smooth functions (Q128676):

Displaying 50 items.

• A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors (Q5346620) (← links)
• Automated parameter selection in the ${L}^{1} \mbox{-} {L}^{2}$-TV model for removing Gaussian plus impulse noise (Q5348004) (← links)
• Optimal Affine-Invariant Smooth Minimization Algorithms (Q5376450) (← links)
• Rounding of convex sets and efficient gradient methods for linear programming problems (Q5459820) (← links)
• Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs (Q5501232) (← links)
• Semidefinite Programming For Chance Constrained Optimization Over Semialgebraic Sets (Q5501233) (← links)
• The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem (Q5506687) (← links)
• ``Efficient” Subgradient Methods for General Convex Optimization (Q5506689) (← links)
• Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians (Q5737717) (← links)
• IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems (Q5737721) (← links)
• An introduction to continuous optimization for imaging (Q5740077) (← links)
• An adaptive constraint tightening approach to linear model predictive control based on approximation algorithms for optimization (Q5745041) (← links)
• An acceleration procedure for optimal first-order methods (Q5746718) (← links)
• The method of codifferential descent for convex and global piecewise affine optimization (Q5859002) (← links)
• A dual approach for optimal algorithms in distributed optimization over networks (Q5859014) (← links)
• Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction (Q5860374) (← links)
• Accelerated Non-Overlapping Domain Decomposition Method for Total Variation Minimization (Q5864761) (← links)
• (Q5866396) (← links)
• Penalty and Augmented Lagrangian Methods for Constrained DC Programming (Q5868956) (← links)
• Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs (Q5870771) (← links)
• Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method (Q5883312) (← links)
• Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries (Q5883715) (← links)
• Accelerated Bregman Primal-Dual Methods Applied to Optimal Transport and Wasserstein Barycenter Problems (Q5885824) (← links)
• Essentials of numerical nonsmooth optimization (Q5918756) (← links)
• Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization (Q5962715) (← links)
• New analysis and results for the Frank-Wolfe method (Q5962717) (← links)
• Iteration-complexity of first-order augmented Lagrangian methods for convex programming (Q5962727) (← links)
• Discussion on: ``Why is resorting to fate wise? A critical look at randomized algorithms in systems and control'' (Q5966128) (← links)
• Essentials of numerical nonsmooth optimization (Q5970841) (← links)
• Unifying mirror descent and dual averaging (Q6038659) (← links)
• A unified analysis of variational inequality methods: variance reduction, sampling, quantization, and coordinate descent (Q6039155) (← links)
• It's All Relative: Regression Analysis with Compositional Predictors (Q6055885) (← links)
• Global Optimization via Schrödinger–Föllmer Diffusion (Q6057791) (← links)
• An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization (Q6064035) (← links)
• Robust enhanced indexation optimization with sparse industry Layout constraint (Q6065610) (← links)
• Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods (Q6073850) (← links)
• A Joint Fairness Model with Applications to Risk Predictions for Underrepresented Populations (Q6079773) (← links)
• Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions (Q6090288) (← links)
• A fast diagonal distance metric learning approach for large-scale datasets (Q6092062) (← links)
• Doubly iteratively reweighted algorithm for constrained compressed sensing models (Q6097766) (← links)
• A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems (Q6097769) (← links)
• Sparse quantile regression (Q6108347) (← links)
• Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing (Q6109887) (← links)
• The landscape of the proximal point method for nonconvex-nonconcave minimax optimization (Q6110439) (← links)
• Heterogeneous Mediation Analysis on Epigenomic PTSD and Traumatic Stress in a Predominantly African American Cohort (Q6110691) (← links)
• Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem (Q6111359) (← links)
• Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization (Q6114954) (← links)
• Accelerated variance-reduced methods for saddle-point problems (Q6114960) (← links)
• A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds (Q6116240) (← links)
• Optimal Methods for Convex Risk-Averse Distributed Optimization (Q6116242) (← links)