Smoothing and First Order Methods: A Unified Framework
From MaRDI portal
Publication:2910884
DOI10.1137/100818327zbMath1251.90304OpenAlexW1972010412MaRDI QIDQ2910884
Publication date: 12 September 2012
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9df16ee1828f8d46cfc6c817dfef540f4c1af51e
Related Items
Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method, An accelerated coordinate gradient descent algorithm for non-separable composite optimization, A Preconditioner for A Primal-Dual Newton Conjugate Gradient Method for Compressed Sensing Problems, A dual method for minimizing a nonsmooth objective over one smooth inequality constraint, Helping you finding an appropriate regularization process, New results on subgradient methods for strongly convex optimization problems with a unified analysis, MAGMA: Multilevel Accelerated Gradient Mirror Descent Algorithm for Large-Scale Convex Composite Minimization, An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems, A simplified view of first order methods for optimization, On the convergence rate of scaled gradient projection method, A Level-Set Method for Convex Optimization with a Feasible Solution Path, New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure, A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization, A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization, Unnamed Item, A new fast algorithm for constrained four-directional total variation image denoising problem, Selective bi-coordinate method for limit non-smooth resource allocation type problems, Linear convergence of Frank-Wolfe for rank-one matrix recovery without strong convexity, A simple convergence analysis of Bregman proximal gradient algorithm, Optimal subgradient algorithms for large-scale convex optimization in simple domains, Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions, A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds, Unnamed Item, Radial duality. II: Applications and algorithms, No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization, Stochastic incremental mirror descent algorithms with Nesterov smoothing, Consistent approximations in composite optimization, First-order methods for convex optimization, A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization, A Nonlocal Graph-PDE and Higher-Order Geometric Integration for Image Labeling, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery, Adversarial classification via distributional robustness with Wasserstein ambiguity, Acceleration of the PDHGM on partially strongly convex functions, A simple nearly optimal restart scheme for speeding up first-order methods, A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem, A Multilevel Proximal Gradient Algorithm for a Class of Composite Optimization Problems, The Distributionally Robust Chance-Constrained Vehicle Routing Problem, Accelerated first-order methods for hyperbolic programming, Smoothing techniques and difference of convex functions algorithms for image reconstructions, Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming, An adaptive primal-dual framework for nonsmooth convex minimization, MARS as an alternative approach of Gaussian graphical model for biochemical networks, A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming, A Randomized Coordinate Descent Method with Volume Sampling, Gradient consistency for integral-convolution smoothing functions, Unnamed Item, FOM – a MATLAB toolbox of first-order methods for solving convex optimization problems, Unnamed Item, Dynamic smoothness parameter for fast gradient methods, Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\), Adaptive smoothing algorithms for nonsmooth composite convex minimization, Fully smoothed \(\ell_1\)-\(TV\) models: bounds for the minimizers and parameter choice, Epi-convergence properties of smoothing by infimal convolution, A First Order Method for Solving Convex Bilevel Optimization Problems, Neural network based on systematically generated smoothing functions for absolute value equation, Weiszfeld's method: old and new results, Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization, A simple algorithm for a class of nonsmooth convex-concave saddle-point problems, A dual reformulation and solution framework for regularized convex clustering problems, Sharpness, Restart, and Acceleration, A convex analysis approach to optimal controls with switching structure for partial differential equations, Accelerated proximal incremental algorithm schemes for non-strongly convex functions, A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems, An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization, A family of subgradient-based methods for convex optimization problems in a unifying framework, Polar Convolution, An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration, Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems, Superquantiles at work: machine learning applications and efficient subgradient computation, A variable smoothing algorithm for solving convex optimization problems, Bilevel Optimization of Regularization Hyperparameters in Machine Learning, Network manipulation algorithm based on inexact alternating minimization, One-Step Estimation with Scaled Proximal Methods, Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs
