Pages that link to "Item:Q312663"

The following pages link to Optimized first-order methods for smooth convex minimization (Q312663):

Displaying 50 items.

• Optimized first-order methods for smooth convex minimization (Q312663) (← links)
• An optimal variant of Kelley's cutting-plane method (Q344947) (← links)
• Fast first-order methods for composite convex optimization with backtracking (Q404292) (← links)
• Smooth strongly convex interpolation and exact worst-case performance of first-order methods (Q507324) (← links)
• The exact information-based complexity of smooth convex minimization (Q511109) (← links)
• On the convergence analysis of the optimized gradient method (Q511969) (← links)
• New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure (Q1659678) (← links)
• Optimal deterministic algorithm generation (Q1668803) (← links)
• Adaptive restart of the optimized gradient method for convex optimization (Q1670019) (← links)
• Exact worst-case convergence rates of the proximal gradient method for composite convex minimization (Q1670100) (← links)
• Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization (Q1730794) (← links)
• Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators (Q1739043) (← links)
• Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions (Q2026726) (← links)
• Nearly optimal first-order methods for convex optimization under gradient norm measure: an adaptive regularization approach (Q2031939) (← links)
• Bounds for the tracking error of first-order online optimization methods (Q2032000) (← links)
• Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems (Q2042418) (← links)
• Analysis of optimization algorithms via sum-of-squares (Q2046552) (← links)
• Generalized Nesterov's accelerated proximal gradient algorithms with convergence rate of order \(o(1/k^2)\) (Q2082553) (← links)
• From differential equation solvers to accelerated first-order methods for convex optimization (Q2089788) (← links)
• Optimal complexity and certification of Bregman first-order methods (Q2149545) (← links)
• A frequency-domain analysis of inexact gradient methods (Q2149575) (← links)
• Convergence rate of inertial proximal algorithms with general extrapolation and proximal coefficients (Q2189628) (← links)
• Efficient first-order methods for convex minimization: a constructive approach (Q2205976) (← links)
• Properties of the sign gradient descent algorithms (Q2214992) (← links)
• Accelerated proximal point method for maximally monotone operators (Q2235140) (← links)
• Performance of first-order methods for smooth convex minimization: a novel approach (Q2248759) (← links)
• Convergence rate of inertial forward-backward algorithm beyond Nesterov's rule (Q2297644) (← links)
• New analysis of linear convergence of gradient-type methods via unifying error bound conditions (Q2297652) (← links)
• Convergence of a relaxed inertial forward-backward algorithm for structured monotone inclusions (Q2338080) (← links)
• Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity (Q2413084) (← links)
• Fast proximal algorithms for nonsmooth convex optimization (Q2661564) (← links)
• Accelerated additive Schwarz methods for convex optimization with adaptive restart (Q2666023) (← links)
• An engineering interpretation of Nesterov's convex minimization algorithm and time integration: application to optimal fiber orientation (Q2666090) (← links)
• Fast gradient methods for uniformly convex and weakly smooth problems (Q2673504) (← links)
• A first-order multigrid method for bound-constrained convex optimization (Q2815552) (← links)
• The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than \(1/k^2\) (Q2817843) (← links)
• On lower and upper bounds in smooth and strongly convex optimization (Q2834440) (← links)
• On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization (Q2902870) (← links)
• First-order and second-order optimality conditions for nonsmooth constrained problems via convolution smoothing (Q2996801) (← links)
• Tight Sublinear Convergence Rate of the Proximal Point Algorithm for Maximal Monotone Inclusion Problems (Q3300773) (← links)
• Generalizing the Optimized Gradient Method for Smooth Convex Minimization (Q4571883) (← links)
• Another Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA) (Q4603039) (← links)
• Convergence Rates of Inertial Forward-Backward Algorithms (Q4609474) (← links)
• Effects of dominance on operation policies in a two-stage supply chain in which market demands follow the Bass diffusion model (Q4634323) (← links)
• Analysis of Optimization Algorithms via Integral Quadratic Constraints: Nonstrongly Convex Problems (Q4687235) (← links)
• On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent (Q4969070) (← links)
• Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method (Q4993286) (← links)
• (Q4995610) (← links)
• (Q4999082) (← links)
• Variational phase recovering without phase unwrapping in phase-shifting interferometry (Q5031858) (← links)