Pages that link to "Item:Q128676"

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

Displaying 50 items.

• Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization (Q2921184) (← links)
• A smoothing stochastic gradient method for composite optimization (Q2926083) (← links)
• Smoothing Techniques-Based Distributed Model Predictive Control Algorithms for Networks (Q2926539) (← links)
• Benchmarking large-scale distributed convex quadratic programming algorithms (Q2943814) (← links)
• On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
• Convergence Rate Analysis of Primal-Dual Splitting Schemes (Q2949517) (← links)
• Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems (Q2957979) (← links)
• Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems (Q2957980) (← links)
• Accelerated Uzawa methods for convex optimization (Q2970101) (← links)
• A PROJECTION APPROACH TO THE NUMERICAL ANALYSIS OF LIMIT LOAD PROBLEMS (Q3087521) (← links)
• SPARSE TEMPLATE-BASED VARIATIONAL IMAGE SEGMENTATION (Q3101551) (← links)
• The smoothing gradient method for a kind of special optimization problem (Q3132645) (← links)
• Domain Decomposition with Nesterov’s Method (Q3133714) (← links)
• Unconstrained Convex Minimization in Relative Scale (Q3169025) (← links)
• Recursive SURE for iterative reweighted least square algorithms (Q3177937) (← links)
• MAGMA: Multilevel Accelerated Gradient Mirror Descent Algorithm for Large-Scale Convex Composite Minimization (Q3179624) (← links)
• A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging (Q3192655) (← links)
• A Randomized Coordinate Descent Method with Volume Sampling (Q3300772) (← links)
• (Q3303383) (← links)
• Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration (Q3391206) (← links)
• Accelerated, Parallel, and Proximal Coordinate Descent (Q3449571) (← links)
• Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems (Q3451761) (← links)
• A Preconditioner for A Primal-Dual Newton Conjugate Gradient Method for Compressed Sensing Problems (Q3454470) (← links)
• Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA (Q3454513) (← links)
• Fast First-Order Algorithms for Packing–Covering Semidefinite Programs (Q3454972) (← links)
• Gradient methods and conic least-squares problems (Q3458817) (← links)
• Structured Sparsity: Discrete and Convex Approaches (Q3460840) (← links)
• An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems (Q3465236) (← links)
• A chain rule for nonsmooth composite functions via minimisation (Q4291005) (← links)
• Generalized System Identification with Stable Spline Kernels (Q4553782) (← links)
• GMRES-Accelerated ADMM for Quadratic Objectives (Q4554067) (← links)
• RSG: Beating Subgradient Method without Smoothness and Strong Convexity (Q4558142) (← links)
• (Q4558559) (← links)
• (Q4558572) (← links)
• A Level-Set Method for Convex Optimization with a Feasible Solution Path (Q4562247) (← links)
• From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming (Q4571046) (← links)
• Generalizing the Optimized Gradient Method for Smooth Convex Minimization (Q4571883) (← links)
• A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization (Q4600841) (← links)
• Another Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA) (Q4603039) (← links)
• Relatively Smooth Convex Optimization by First-Order Methods, and Applications (Q4603043) (← links)
• Proximal Methods for Stationary Mean Field Games with Local Couplings (Q4608230) (← links)
• Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming (Q4622887) (← links)
• A generic online acceleration scheme for optimization algorithms via relaxation and inertia (Q4622890) (← links)
• A Finite Element Approach for the Dual Rudin--Osher--Fatemi Model and Its Nonoverlapping Domain Decomposition Methods (Q4628400) (← links)
• The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods (Q4629338) (← links)
• Portfolio selection with the effect of systematic risk diversification: formulation and accelerated gradient algorithm (Q4631770) (← links)
• String-averaging incremental stochastic subgradient algorithms (Q4631774) (← links)
• Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization (Q4636997) (← links)
• A General Distributed Dual Coordinate Optimization Framework for Regularized Loss Minimization (Q4637039) (← links)
• (Q4637041) (← links)