Pages that link to "Item:Q2910891"

The following pages link to Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization (Q2910891):

Displaying 17 items.

• A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677) (← links)
• Efficient numerical methods for entropy-linear programming problems (Q327229) (← links)
• First-order methods of smooth convex optimization with inexact oracle (Q403634) (← links)
• Primal-dual methods for solving infinite-dimensional games (Q493268) (← links)
• Smooth strongly convex interpolation and exact worst-case performance of first-order methods (Q507324) (← links)
• Adaptive smoothing algorithms for nonsmooth composite convex minimization (Q523569) (← links)
• Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457) (← links)
• Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352) (← links)
• A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems (Q1946618) (← links)
• A stochastic Nesterov's smoothing accelerated method for general nonsmooth constrained stochastic composite convex optimization (Q2103421) (← links)
• Augmented Lagrangian optimization under fixed-point arithmetic (Q2208540) (← links)
• An adaptive primal-dual framework for nonsmooth convex minimization (Q2220901) (← links)
• A variable smoothing algorithm for solving convex optimization problems (Q2343070) (← links)
• Certification aspects of the fast gradient method for solving the dual of parametric convex programs (Q2392808) (← links)
• Convergence Analysis of Approximate Primal Solutions in Dual First-Order Methods (Q2834559) (← links)
• Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs (Q5870771) (← links)
• Decentralized convex optimization on time-varying networks with application to Wasserstein barycenters (Q6149580) (← links)