We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:

Search Results

Showing 1-20 of 1,117 results
  1. 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...

    Article 02 July 2022
  2. 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....

    Woocheol Choi, Changbum Chun, ... Sangwoon Yun in Optimization Letters
    Article 19 June 2024
  3. 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...
    Alexey Chernov, Anna Lisachenko in Optimization and Applications
    Conference paper 2023
  4. 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...

    Felipe Angeles, Alberto Saldaña in Fractional Calculus and Applied Analysis
    Article Open access 24 May 2023
  5. 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...

    Dawid Tarłowski in Journal of Global Optimization
    Article Open access 24 November 2023
  6. 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...

    Johannes Müller, Guido Montúfar in Information Geometry
    Article Open access 02 June 2023
  7. 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...

    Peng-Jie Liu, **-Bao Jian, ... **ao-Yu Wu in Journal of the Operations Research Society of China
    Article 12 February 2024
  8. 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...

    Hiroyuki Ochiai, Yoshiyuki Sekiguchi, Hayato Waki in Japan Journal of Industrial and Applied Mathematics
    Article 12 April 2023
  9. 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...

    M.M. Wang, X.J. Wang in Acta Mathematica Hungarica
    Article 01 June 2023
  10. 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...

    Cheik Traoré, Saverio Salzo, Silvia Villa in Computational Optimization and Applications
    Article Open access 17 May 2023
  11. 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...

    Suyun Liu, Luis Nunes Vicente in Journal of Optimization Theory and Applications
    Article 28 June 2023
  12. 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...

    Yumin Ma, **ngju Cai, ... Deren Han in Journal of Scientific Computing
    Article 01 February 2023
  13. 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...

    Article Open access 02 November 2023
  14. 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...

    Jakub Wiktor Both in Optimization Letters
    Article Open access 24 May 2021
  15. 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...

    Shenglong Hu, Ke Ye in Mathematical Programming
    Article 30 July 2022
  16. 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...

    Murat A. Erdogdu, Asuman Ozdaglar, ... Nuri Denizcan Vanli in Mathematical Programming
    Article 30 July 2021
  17. 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...

    Tianxiang Liu, Bruno F. Lourenço in Foundations of Computational Mathematics
    Article 18 October 2022
  18. 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...

    Feng-xiang Feng, Ding-cheng Wang, Qun-ying Wu in Applied Mathematics-A Journal of Chinese Universities
    Article Open access 12 September 2023
  19. Asymptotic linear convergence of fully-corrective generalized conditional gradient methods

    We propose a fully-corrective generalized conditional gradient method (FC-GCG) for the minimization of the sum of a smooth, convex loss function and...

    Kristian Bredies, Marcello Carioni, ... Daniel Walter in Mathematical Programming
    Article Open access 13 July 2023
Did you find what you were looking for? Share feedback.