Convergence analysis under consistent error bounds
From MaRDI portal
Abstract: We introduce the notion of consistent error bound functions which provides a unifying framework for error bounds for multiple convex sets. This framework goes beyond the classical Lipschitzian and H"olderian error bounds and includes logarithmic and entropic error bounds found in the exponential cone. It also includes the error bounds obtainable under the theory of amenable cones. Our main result is that the convergence rate of several projection algorithms for feasibility problems can be expressed explicitly in terms of the underlying consistent error bound function. Another feature is the usage of Karamata theory and functions of regular variations which allows us to reason about convergence rates while bypassing certain complicated expressions. Finally, applications to conic feasibility problems are given and we show that a number of algorithms have convergence rates depending explicitly on the singularity degree of the problem.
Recommendations
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
- Error bounds, facial residual functions and applications to the exponential cone
- Error bounds and convergence analysis of feasible descent methods: A general approach
- New error bounds and their applications to convergence analysis of iterative algorithms
- Convergence rate analysis of iteractive algorithms for solving variational inequality problems
Cited in
(3)
This page was built for publication: Convergence analysis under consistent error bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6347968)
