Image de couverture de livre

A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Yoon, TaeHo, Grimmer, Benjamin
Format:	Preprint
Publié:	2026
Sujets:	Optimization and Control 47H09, 47J26, 65J15, 68Q25, 90C47, 90C60
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the Convergence of HalpernSGD
par: Colao, Vittorio, et autres
Publié: (2026)

Mini-Batch Stochastic Krasnosel'ski\uı-Mann Algorithm for Nonexpansive Fixed Point Problems
par: Iiduka, Hideaki
Publié: (2026)

On Opial's Lemma
par: Arakcheev, Aleksandr, et autres
Publié: (2025)

Reinforcement-learning-based Algorithms for Optimization Problems and Applications to Inverse Problems
par: Xu, Chen, et autres
Publié: (2023)

New operator designs for Halpern iterations with explicit rates under Hölder error bounds
par: Barros, Pablo, et autres
Publié: (2026)

Symplectic Discretization Approach for Developing New Proximal Point Algorithm
par: Yuan, Ya-xiang, et autres
Publié: (2023)

A robust regularized extreme learning machine for regression problems based on self-adaptive accelerated extra-gradient algorithm
par: Adegoke, Muideen, et autres
Publié: (2024)

Existence Results and KKT Optimality Conditions for Generalized Quasiconvex Functions
par: Alizadeh, M. H., et autres
Publié: (2026)

Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems
par: Kong, Weiwei
Publié: (2022)

Graph splitting methods: Fixed points and strong convergence for linear subspaces
par: Aragón-Artacho, Francisco J., et autres
Publié: (2025)

Level proximal subdifferential, variational convexity, and pointwise quadratic approximation
par: Luo, Honglin, et autres
Publié: (2024)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
par: Nesterov, Yurii
Publié: (2025)

Distributed accelerated proximal conjugate gradient methods for multi-agent constrained optimization problems
par: Gebrie, Anteneh Getachew
Publié: (2023)

A proximal-gradient inertial algorithm with Tikhonov regularization: strong convergence to the minimal norm solution
par: László, Szilárd Csaba
Publié: (2024)

Application and issues in abstract convexity
par: Millán, Reinier Díaz, et autres
Publié: (2022)

A reconsideration of quasimonotone variational inequality problems
par: Wang, Meiying, et autres
Publié: (2025)

Fast Krasnoselskii-Mann Method with Overrelaxation and Preconditioners
par: Boţ, Radu I., et autres
Publié: (2024)

Splitting the Forward-Backward Algorithm: A Full Characterization
par: Åkerman, Anton, et autres
Publié: (2025)

Stochastic Krasnoselskii-Mann Iterations: Convergence without Uniformly Bounded Variance
par: Cortild, Daniel, et autres
Publié: (2026)

Three-Operator Splitting Method with Two-Step Inertial Extrapolation
par: Iyiola, Olaniyi S., et autres
Publié: (2024)

Boţ-Nguyen Acceleration, Weighted Mean Ergodic Iteration, and the Beta-Binomial Distribution
par: Bauschke, Heinz H., et autres
Publié: (2026)

On the convergence of an inertial proximal algorithm with a Tikhonov regularization term
par: László, Szilárd Csaba
Publié: (2023)

Splitting Algorithms for Distributionally Robust Optimization
par: Briceño-Arias, Luis, et autres
Publié: (2024)

Multivariate approximation by polynomial and generalised rational functions
par: Millán, R. Díaz, et autres
Publié: (2021)

Solving Equilibrium Problem with New Inertial Technique
par: Nwakpa, Chidi Elijah, et autres
Publié: (2025)

Forward-Backward-Forward Dynamical System for Solving Mixed Variational Inequality Problems
par: Nwakpa, Chidi Elijah, et autres
Publié: (2025)

Proximal and Contraction method with Relaxed Inertial and Correction Terms for Solving Mixed Variational Inequality Problems
par: Nwakpa, Chidi Elijah, et autres
Publié: (2025)

On Generalized Forward-Reflected-Backward Method for Monotone Inclusion Problems
par: Soe, Santanu, et autres
Publié: (2025)

Krasnoselskii-Mann Iterations: Inertia, Perturbations and Approximation
par: Cortild, Daniel, et autres
Publié: (2024)

Symplectic Extra-gradient Type Method for Solving General Non-monotone Inclusion Problem
par: Yuan, Ya-xiang, et autres
Publié: (2024)

Fast Optimistic Gradient Descent Ascent (OGDA) method in continuous and discrete time
par: Bot, Radu Ioan, et autres
Publié: (2022)

Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
par: Turan, Evren M., et autres
Publié: (2023)

Nonlinear Conjugate Gradient Methods for Optimization of Set-Valued Mappings of Finite Cardinality
par: Ghosh, Debdas, et autres
Publié: (2024)

Quasi-Newton Method for Set Optimization Problems with Set-Valued Mapping Given by Finitely Many Vector-Valued Functions
par: Ghosh, Debdas, et autres
Publié: (2024)

Large-Scale Minimization of the Pseudospectral Abscissa
par: Aliyev, Nicat, et autres
Publié: (2022)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
par: Bot, Radu Ioan, et autres
Publié: (2024)

Tikhonov regularization of monotone operator flows not only ensures strong convergence of the trajectories but also speeds up the vanishing of the residuals
par: Bot, Radu Ioan, et autres
Publié: (2024)

Difference of Convex (DC) approach for neural network approximation with uniform loss function
par: Peiris, Vinesha, et autres
Publié: (2026)

Converting exhausters and coexhausters
par: Abbasov, Majid E.
Publié: (2021)

PL conditions do not guarantee convergence of gradient descent-ascent dynamics
par: Mourrat, Jean-Christophe
Publié: (2026)