Pages that link to "Item:Q5317557"

The following pages link to Excessive Gap Technique in Nonsmooth Convex Minimization (Q5317557):

Displaying 50 items.

• Primal-dual subgradient methods for convex problems (Q116219) (← links)
• New results on subgradient methods for strongly convex optimization problems with a unified analysis (Q316174) (← links)
• Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems (Q354625) (← links)
• Accelerated training of max-margin Markov networks with kernels (Q391744) (← links)
• First-order methods of smooth convex optimization with inexact oracle (Q403634) (← links)
• First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games (Q431003) (← links)
• Robust least square semidefinite programming with applications (Q457207) (← links)
• Nesterov's smoothing and excessive gap methods for an optimization problem in VLSI placement (Q489145) (← links)
• Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization (Q519779) (← links)
• Adaptive smoothing algorithms for nonsmooth composite convex minimization (Q523569) (← links)
• Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
• Barrier subgradient method (Q633113) (← links)
• Convex relaxations of penalties for sparse correlated variables with bounded total variation (Q747277) (← links)
• Algorithms and software for total variation image reconstruction via first-order methods (Q849148) (← links)
• Dual extrapolation and its applications to solving variational inequalities and related problems (Q868471) (← links)
• Smoothing technique and its applications in semidefinite optimization (Q879964) (← links)
• Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457) (← links)
• On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
• Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352) (← links)
• Conjugate gradient type methods for the nondifferentiable convex minimization (Q1941196) (← links)
• A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems (Q1946618) (← links)
• Solving nearly-separable quadratic optimization problems as nonsmooth equations (Q2013144) (← links)
• Suppressing homoclinic chaos for a weak periodically excited non-smooth oscillator (Q2023106) (← links)
• Counterfactual regret minimization for integrated cyber and air defense resource allocation (Q2030546) (← links)
• Dai-Liao extensions of a descent hybrid nonlinear conjugate gradient method with application in signal processing (Q2116059) (← links)
• Accelerated gradient sliding for structured convex optimization (Q2141354) (← links)
• Soft clustering by convex electoral model (Q2156895) (← links)
• An adaptive primal-dual framework for nonsmooth convex minimization (Q2220901) (← links)
• Regret bounded by gradual variation for online convex optimization (Q2251474) (← links)
• Faster algorithms for extensive-form game solving via improved smoothing functions (Q2288198) (← links)
• Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity (Q2311123) (← links)
• An efficient primal dual prox method for non-smooth optimization (Q2339936) (← links)
• A variable smoothing algorithm for solving convex optimization problems (Q2343070) (← links)
• Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization (Q2515032) (← links)
• Near-optimal no-regret algorithms for zero-sum games (Q2516247) (← links)
• Fast inexact decomposition algorithms for large-scale separable convex optimization (Q2790883) (← links)
• A family of subgradient-based methods for convex optimization problems in a unifying framework (Q2829570) (← links)
• Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization (Q2921184) (← links)
• Gradient methods and conic least-squares problems (Q3458817) (← links)
• Structured Sparsity: Discrete and Convex Approaches (Q3460840) (← links)
• A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization (Q4600841) (← links)
• Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates (Q4971027) (← links)
• Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming (Q4976160) (← links)
• On the acceleration of the double smoothing technique for unconstrained convex optimization problems (Q4981856) (← links)
• Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method (Q4993286) (← links)
• (Q5020878) (← links)
• New Primal-Dual Algorithms for a Class of Nonsmooth and Nonlinear Convex-Concave Minimax Problems (Q5043287) (← links)
• Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems (Q5085148) (← links)
• (Q5116489) (← links)
• Solving variational inequalities with Stochastic Mirror-Prox algorithm (Q5168840) (← links)