Search
Search Results
-
Tight Ergodic Sublinear Convergence Rate of the Relaxed Proximal Point Algorithm for Monotone Variational Inequalities
This paper considers the relaxed proximal point algorithm for solving monotone variational inequality problems, and our main contribution is the...
-
On the linear convergence rate of Riemannian proximal gradient method
Composite optimization problems on Riemannian manifolds arise in applications such as sparse principal component analysis and dictionary learning....
-
-
Convergence Rate of Gradient-Concordant Methods for Smooth Unconstrained Optimization
The article discusses the class of gradient-concordant numerical methods for smooth unconstrained minimization where the descent direction is... -
Small order limit of fractional Dirichlet sublinear-type problems
We study the asymptotic behavior of solutions to various Dirichlet sublinear-type problems involving the fractional Laplacian when the fractional...
-
On asymptotic convergence rate of random search
This paper presents general theoretical studies on asymptotic convergence rate (ACR) for finite dimensional optimization. Given the continuous...
-
Geometry and convergence of natural policy gradient methods
We study the convergence of several natural policy gradient (NPG) methods in infinite-horizon discounted Markov decision processes with regular...
-
A Bregman-Style Improved ADMM and its Linearized Version in the Nonconvex Setting: Convergence and Rate Analyses
This work explores a family of two-block nonconvex optimization problems subject to linear constraints. We first introduce a simple but universal...
-
Exact convergence rates of alternating projections for nontransversal intersections
We consider the convergence rate of the alternating projection method for the nontransversal intersection of a semialgebraic set and a linear...
-
Equivalent conditions of complete convergence and Marcinkiewicz–Zygmund-type strong law of large numbers for i.i.d. sequences under sub-linear expectations
Under suitable conditions, we study the equivalent conditions of complete convergence and the Marcinkiewicz–Zygmund-type strong law of large numbers...
-
Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization
In this paper, we study the convergence properties of a randomized block-coordinate descent algorithm for the minimization of a composite convex...
-
Convergence Rates of the Stochastic Alternating Algorithm for Bi-Objective Optimization
Stochastic alternating algorithms for bi-objective optimization are considered when optimizing two conflicting functions for which optimization steps...
-
Understanding the Convergence of the Preconditioned PDHG Method: A View of Indefinite Proximal ADMM
The primal-dual hybrid gradient (PDHG) algorithm is popular in solving min-max problems which are being widely used in a variety of areas. To improve...
-
On Convergence Rates of Proximal Alternating Direction Method of Multipliers
In this paper we consider from two different aspects the proximal alternating direction method of multipliers (ADMM) in Hilbert spaces. We first...
-
On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces
In this paper, the convergence of the fundamental alternating minimization is established for non-smooth non-strongly convex optimization problems in...
-
Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations
Low rank orthogonal tensor approximation (LROTA) is an important problem in tensor computations and their applications. A classical and widely used...
-
Convergence rate of block-coordinate maximization Burer–Monteiro method for solving large SDPs
Semidefinite programming (SDP) with diagonal constraints arise in many optimization problems, such as Max-Cut, community detection and group...
-
Convergence Analysis under Consistent Error Bounds
We introduce the notion of consistent error bound functions which provides a unifying framework for error bounds for multiple convex sets. This...
-
Complete moment convergence for ND random variables under the sub-linear expectations
In this article, we establish a general result on complete moment convergence for arrays of rowwise negatively dependent(ND) random variables under...
-
Sublinear Regret with Barzilai-Borwein Step Sizes
This paper considers the online scenario using the Barzilai-Borwein Quasi-Newton Method. In an online optimization problem, an online agent uses a...