Pages that link to "Item:Q3465237"
From MaRDI portal
The following pages link to Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints (Q3465237):
Displaying 50 items.
- Proximal Methods for Sparse Optimal Scoring and Discriminant Analysis (Q97534) (← links)
- Zames-Falb multipliers for absolute stability: from O'Shea's contribution to convex searches (Q285795) (← links)
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods (Q507324) (← links)
- On the convergence analysis of the optimized gradient method (Q511969) (← links)
- Learning-based adaptive control with an accelerated iterative adaptive law (Q776058) (← links)
- A dynamical view of nonlinear conjugate gradient methods with applications to FFT-based computational micromechanics (Q785497) (← 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)
- Convergence of first-order methods via the convex conjugate (Q1728354) (← links)
- Stability analysis by dynamic dissipation inequalities: on merging frequency-domain techniques with time-domain conditions (Q1729052) (← links)
- Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions (Q2020604) (← links)
- Analysis of biased stochastic gradient descent using sequential semidefinite programs (Q2020610) (← links)
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods (Q2023684) (← links)
- Bounds for the tracking error of first-order online optimization methods (Q2032000) (← links)
- Analysis of optimization algorithms via sum-of-squares (Q2046552) (← links)
- Bearing-only distributed localization: a unified barycentric approach (Q2065169) (← links)
- Iterative pre-conditioning for expediting the distributed gradient-descent method: the case of linear least-squares problem (Q2071934) (← links)
- Understanding the acceleration phenomenon via high-resolution differential equations (Q2089769) (← links)
- From differential equation solvers to accelerated first-order methods for convex optimization (Q2089788) (← links)
- A control-theoretic perspective on optimal high-order optimization (Q2089793) (← links)
- Passivity-based analysis of the ADMM algorithm for constraint-coupled optimization (Q2097705) (← links)
- An adaptive Polyak heavy-ball method (Q2102380) (← links)
- On the convergence analysis of aggregated heavy-ball method (Q2104283) (← links)
- A frequency-domain analysis of inexact gradient methods (Q2149575) (← links)
- Synthesis of accelerated gradient algorithms for optimization and saddle point problems using Lyapunov functions and LMIs (Q2154842) (← links)
- Analytical convergence regions of accelerated gradient descent in nonconvex optimization under regularity condition (Q2173914) (← links)
- A regularization interpretation of the proximal point method for weakly convex functions (Q2179443) (← links)
- Efficient first-order methods for convex minimization: a constructive approach (Q2205976) (← links)
- A simple PID-based strategy for particle swarm optimization algorithm (Q2224877) (← links)
- A review of nonlinear FFT-based computational homogenization methods (Q2234259) (← links)
- Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization (Q2235149) (← links)
- Regularized nonlinear acceleration (Q2288185) (← links)
- On polarization-based schemes for the FFT-based computational homogenization of inelastic materials (Q2329615) (← links)
- Explicit stabilised gradient descent for faster strongly convex optimisation (Q2660598) (← links)
- Proximal gradient flow and Douglas-Rachford splitting dynamics: global exponential stability via integral quadratic constraints (Q2662276) (← links)
- On data-driven stabilization of systems with nonlinearities satisfying quadratic constraints (Q2670734) (← links)
- Perturbed Fenchel duality and first-order methods (Q2687051) (← links)
- Mini-workshop: Analysis of data-driven optimal control. Abstracts from the mini-workshop held May 9--15, 2021 (hybrid meeting) (Q2693004) (← links)
- Search Direction Correction with Normalized Gradient Makes First-Order Methods Faster (Q3382800) (← links)
- Generalizing the Optimized Gradient Method for Smooth Convex Minimization (Q4571883) (← links)
- Another Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA) (Q4603039) (← links)
- An Optimal First Order Method Based on Optimal Quadratic Averaging (Q4603040) (← links)
- Convergence Rates of Proximal Gradient Methods via the Convex Conjugate (Q4620416) (← links)
- Analysis of Optimization Algorithms via Integral Quadratic Constraints: Nonstrongly Convex Problems (Q4687235) (← links)
- Projected Dynamical Systems on Irregular, Non-Euclidean Domains for Nonlinear Optimization (Q4965188) (← links)
- (Q4969223) (← links)
- Connections between Georgiou and Smith's Robust Stability Type Theorems and the Nonlinear Small-Gain Theorems (Q4992022) (← links)
- The Connections Between Lyapunov Functions for Some Optimization Algorithms and Differential Equations (Q4994418) (← links)
- (Q4998888) (← links)
