The following pages link to PESTO (Q32678):
Displaying 41 items.
- Optimized first-order methods for smooth convex minimization (Q312663) (← 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)
- On the convergence rate of the Halpern-iteration (Q828660) (← links)
- Exact worst-case convergence rates of the proximal gradient method for composite convex minimization (Q1670100) (← links)
- On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions (Q1679617) (← links)
- Analysis of biased stochastic gradient descent using sequential semidefinite programs (Q2020610) (← links)
- Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions (Q2026726) (← links)
- Bounds for the tracking error of first-order online optimization methods (Q2032000) (← links)
- Analysis of optimization algorithms via sum-of-squares (Q2046552) (← links)
- On the oracle complexity of smooth strongly convex minimization (Q2052164) (← links)
- Optimal step length for the Newton method: case of self-concordant functions (Q2067259) (← links)
- Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis (Q2133415) (← links)
- Optimal complexity and certification of Bregman first-order methods (Q2149545) (← links)
- Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry (Q2149561) (← links)
- A frequency-domain analysis of inexact gradient methods (Q2149575) (← links)
- Backward-forward-reflected-backward splitting for three operator monotone inclusions (Q2185395) (← links)
- Efficient first-order methods for convex minimization: a constructive approach (Q2205976) (← links)
- Accelerated methods for saddle-point problem (Q2214606) (← links)
- Fast gradient descent for convex minimization problems with an oracle producing a \(( \delta, L)\)-model of function at the requested point (Q2278192) (← links)
- New analysis of linear convergence of gradient-type methods via unifying error bound conditions (Q2297652) (← links)
- Finding the forward-Douglas-Rachford-forward method (Q2302831) (← links)
- Finitely determined functions (Q2656197) (← links)
- Surrogate-based distributed optimisation for expensive black-box functions (Q2663899) (← links)
- The exact worst-case convergence rate of the gradient method with fixed step lengths for \(L\)-smooth functions (Q2673524) (← links)
- Halting time is predictable for large models: a universality property and average-case analysis (Q2697399) (← 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)
- A generic online acceleration scheme for optimization algorithms via relaxation and inertia (Q4622890) (← links)
- Analysis of Optimization Algorithms via Integral Quadratic Constraints: Nonstrongly Convex Problems (Q4687235) (← links)
- (Q4999039) (← links)
- (Q4999082) (← links)
- Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation (Q5116548) (← links)
- Operator Splitting Performance Estimation: Tight Contraction Factors and Optimal Parameter Selection (Q5123997) (← links)
- Data-Driven Nonsmooth Optimization (Q5210515) (← links)
- Analysis of the gradient method with an Armijo–Wolfe line search on a class of non-smooth convex functions (Q5210738) (← links)
- Solving inverse problems using data-driven models (Q5230520) (← links)
- Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization (Q5275297) (← links)
- On the Properties of Convex Functions over Open Sets (Q5856375) (← links)
