Pages that link to "Item:Q4687235"
From MaRDI portal
The following pages link to Analysis of Optimization Algorithms via Integral Quadratic Constraints: Nonstrongly Convex Problems (Q4687235):
Displayed 27 items.
- Analysis of optimization algorithms via sum-of-squares (Q2046552) (← links)
- Iterative pre-conditioning for expediting the distributed gradient-descent method: the case of linear least-squares problem (Q2071934) (← 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)
- Model-free based control of a HIV/AIDS prevention model (Q2130123) (← 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)
- Efficient first-order methods for convex minimization: a constructive approach (Q2205976) (← links)
- Proximal gradient flow and Douglas-Rachford splitting dynamics: global exponential stability via integral quadratic constraints (Q2662276) (← links)
- Robust hybrid zero-order optimization algorithms with acceleration via averaging in time (Q2662325) (← links)
- Projected Dynamical Systems on Irregular, Non-Euclidean Domains for Nonlinear Optimization (Q4965188) (← links)
- The Connections Between Lyapunov Functions for Some Optimization Algorithms and Differential Equations (Q4994418) (← links)
- Robust and structure exploiting optimisation algorithms: an integral quadratic constraint approach (Q5012635) (← links)
- Convex Synthesis of Accelerated Gradient Algorithms (Q5020736) (← links)
- Analysis of a generalised expectation–maximisation algorithm for Gaussian mixture models: a control systems perspective (Q5043530) (← links)
- (Q5053262) (← links)
- Zames–Falb multipliers for convergence rate: motivating example and convex searches (Q5069015) (← links)
- Differentially Private Accelerated Optimization Algorithms (Q5080503) (← links)
- Contractivity of Runge--Kutta Methods for Convex Gradient Systems (Q5115704) (← links)
- Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions (Q5853717) (← links)
- Novel projection neurodynamic approaches for constrained convex optimization (Q6072585) (← links)
- A zeroing neural dynamics based acceleration optimization approach for optimizers in deep neural networks (Q6072593) (← links)
- A fixed step distributed proximal gradient push‐pull algorithm based on integral quadratic constraint (Q6081040) (← links)
- A Systematic Approach to Lyapunov Analyses of Continuous-Time Models in Convex Optimization (Q6116244) (← links)
- Dynamics based privacy preservation in decentralized optimization (Q6163983) (← links)
- A Nonlocal Graph-PDE and Higher-Order Geometric Integration for Image Labeling (Q6173532) (← links)