Cover Image

$\mathcal{KL}$ and Lyapunov Approaches for Discrete-time Peak Computation Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Adjé, Assalé
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Dynamical Systems 39A30, 65Q10, 90C26
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Extensions of $\mathcal{KL}$ and Lyapunov Functions for Discrete-time Dynamical System Peaks Analysis
by: Adjé, Assalé
Published: (2024)

On the Maximization of Real Sequences
by: Adjé, Assalé
Published: (2025)

A Parametric Optimization Point-Of-View of Comparison Functions
by: Adjé, Assalé
Published: (2024)

Optimization on the Oblique Manifold for Sparse Simplex Constraints via Multiplicative Updates
by: Esposito, Flavia, et al.
Published: (2025)

Solving nonconvex optimization problems via a second order dynamical system with unbounded damping
by: László, Szilárd Csaba
Published: (2025)

Binno: A 1st-order method for Bi-level Nonconvex Nonsmooth Optimization for Matrix Factorizations
by: Selicato, Laura, et al.
Published: (2025)

A distributed Douglas-Rachford splitting method for solving linear constrained multi-block weakly convex problems
by: Hu, Leyu, et al.
Published: (2024)

Bivariate rational approximations of the general temperature integral
by: Aghili, Alireza, et al.
Published: (2024)

Forward-Backward algorithms for weakly convex problems
by: Bednarczuk, Ewa, et al.
Published: (2023)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
by: Marumo, Naoki
Published: (2025)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
by: Zhang, Chenyu, et al.
Published: (2023)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
by: Xie, Xiyuan, et al.
Published: (2025)

Splitting the Conditional Gradient Algorithm
by: Woodstock, Zev, et al.
Published: (2023)

Strong Global Convergence of the Consensus-Based Optimization Algorithm
by: Bonandin, Sabrina, et al.
Published: (2025)

Benign landscapes for synchronization on spheres via normalized Laplacian matrices
by: McRae, Andrew D.
Published: (2025)

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
by: Aguirre, Jacob M., et al.
Published: (2025)

Quadratic Convergence of a Projection Method for a Plane Curve Feasibility Problem
by: Collard, Jordan, et al.
Published: (2025)

Computing Bouligand stationary points efficiently in low-rank optimization
by: Olikier, Guillaume, et al.
Published: (2024)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
by: Deng, Kangkang, et al.
Published: (2024)

Constrained Consensus-Based Optimization and Numerical Heuristics for the Few Particle Regime
by: Beddrich, Jonas, et al.
Published: (2024)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
by: Deng, Kangkang, et al.
Published: (2025)

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
by: Millán, R. Díaz, et al.
Published: (2026)

Shadow splitting methods for nonconvex optimisation: epi-approximation, convergence and saddle point avoidance
by: Atenas, Felipe
Published: (2025)

Understanding the Douglas-Rachford splitting method through the lenses of Moreau-type envelopes
by: Atenas, Felipe
Published: (2023)

Nonlinear constrained optimization of Schur test functions
by: Anikushin, Mikhail, et al.
Published: (2025)

Range of optimal values in absolute value linear programming with interval data
by: Hladík, Milan
Published: (2025)

Efficient globalization of heavy-ball type methods for unconstrained optimization based on curve searches
by: Donnini, Federica, et al.
Published: (2025)

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
by: Xie, Lijun, et al.
Published: (2025)

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
by: Marumo, Naoki, et al.
Published: (2023)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
by: Li, Qia, et al.
Published: (2024)

Local Convergence Analysis of ADMM for Nonconvex Composite Optimization
by: Xie, Xiyuan, et al.
Published: (2026)

On the Finiteness Property of the Polynomial Complementarity Problem
by: Sharma, Sonali, et al.
Published: (2025)

Extended Horizontal Tensor Complementarity Problems
by: Sharma, Sonali, et al.
Published: (2025)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
by: Brosch, Daniel, et al.
Published: (2025)

Swarm-based optimization with jumps: a kinetic BGK framework and convergence analysis
by: Borghi, Giacomo, et al.
Published: (2025)

An Inexact Regularized Proximal Newton Method without Line Search
by: Dahl, Simeon vom, et al.
Published: (2024)

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
by: Yuan, Ya-xiang, et al.
Published: (2024)

Reinforcement-learning-based Algorithms for Optimization Problems and Applications to Inverse Problems
by: Xu, Chen, et al.
Published: (2023)

An Extended ADMM for 3-Block Nonconvex Nonseparable Problems with Applications
by: Liu, Zekun
Published: (2024)