Primal-Dual algorithms for Abstract convex functions with respect to quadratic functions
Optimization and Control
2026-01-13 v1 Numerical Analysis
Numerical Analysis
Abstract
We consider the saddle point problem where the objective functions are abstract convex with respect to the class of quadratic functions. We propose primal-dual algorithms using the corresponding abstract proximal operator and investigate the convergence under certain restrictions. We test our algorithms by several numerical examples.
Cite
@article{arxiv.2601.07076,
title = {Primal-Dual algorithms for Abstract convex functions with respect to quadratic functions},
author = {Ewa Bednarczuk and The Hung Tran},
journal= {arXiv preprint arXiv:2601.07076},
year = {2026}
}