M. Marques Alves

Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods

  • M. Marques Alves
    • Categories Convex and Nonsmooth Optimization Tags , , , , , , ,

    For solving strongly convex optimization problems, we propose and study the global convergence of variants of the A-HPE and large-step A-HPE algorithms of Monteiro and Svaiter. We prove \emph{linear} and the \emph{superlinear} $\mathcal{O}\left(k^{\,-k\left(\frac{p-1}{p+1}\right)}\right)$ global rates for the proposed variants of the A-HPE and large-step A-HPE methods, respectively. The parameter $p\geq 2$ appears in the (high-order) … Read more

    A relative-error inertial-relaxed inexact projective splitting algorithm

  • M. Marques Alves
  • Raul T. Marcavillaca
  • Marina Geremia
    • Categories Convex and Nonsmooth Optimization Tags , , , ,

    For solving structured monotone inclusion problems involving the sum of finitely many maximal monotone operators, we propose and study a relative-error inertial-relaxed inexact projective splitting algorithm. The proposed algorithm benefits from a combination of inertial and relaxation effects, which are both controlled by parameters within a certain range. We propose sufficient conditions on these parameters … Read more

    Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms

  • M. Marques Alves
  • Jonathan Eckstein
  • Jefferson Gonçalves Melo
  • Marina Geremia
    • Categories Convex and Nonsmooth Optimization Tags , , , , ,

    This paper derives new inexact variants of the Douglas-Rachford splitting method for maximal monotone operators and the alternating direction method of multipliers (ADMM) for convex optimization. The analysis is based on a new inexact version of the proximal point algorithm that includes both an inertial step and overrelaxation. We apply our new inexact ADMM method … Read more

    On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng’s modified forward-backward methods with inertial effects

  • M. Marques Alves
  • Raul T. Marcavillaca
    • Categories Convex and Nonsmooth Optimization Tags , , , , , , , ,

    In this paper, we propose and study the asymptotic convergence and nonasymptotic global convergence rates (iteration-complexity) of an inertial under-relaxed version of the relative-error hybrid proximal extragradient (HPE) method for solving monotone inclusion problems. We analyze the proposed method under more flexible assumptions than existing ones on the extrapolation and relative-error parameters. As applications, we … Read more

    Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng’s F-B four-operator splitting method for solving monotone inclusions

  • M. Marques Alves
  • Marina Geremia
    • Categories Convex and Nonsmooth Optimization

    In this paper, we propose and study the iteration complexity of an inexact Douglas-Rachford splitting (DRS) method and a Douglas-Rachford-Tseng’s forward-backward (F-B) splitting method for solving two-operator and four-operator monotone inclusions, respectively. The former method (although based on a slightly different mechanism of iteration) is motivated by the recent work of J. Eckstein and W. … Read more

    An Inexact Spingarn’s Partial Inverse Method with Applications to Operator Splitting and Composite Optimization

  • M. Marques Alves
  • Samara Costa Lima
    • Categories Convex and Nonsmooth Optimization Tags , , , , , ,

    We propose and study the iteration-complexity of an inexact version of the Spingarn’s partial inverse method. Its complexity analysis is performed by viewing it in the framework of the hybrid proximal extragradient (HPE) method, for which pointwise and ergodic iteration-complexity has been established recently by Monteiro and Svaiter. As applications, we propose and analyze the … Read more

    A proximal-Newton method for unconstrained convex optimization in Hilbert spaces

  • M. Marques Alves
  • Benar Fux Svaiter
    • Categories Convex and Nonsmooth Optimization Tags , , ,

    We propose and study the iteration-complexity of a proximal-Newton method for finding approximate solutions of the problem of minimizing a twice continuously differentiable convex function on a (possibly infinite dimensional) Hilbert space. We prove global convergence rates for obtaining approximate solutions in terms of function/gradient values. Our main results follow from an iteration-complexity study of … Read more

    Iteration-complexity of a Rockafellar’s proximal method of multipliers for convex programming based on second-order approximations

  • M. Marques Alves
  • Renato D.C. Monteiro
  • Benar Fux Svaiter
    • Categories Constrained Nonlinear Optimization, Convex Optimization, Global Optimization Tags , , , ,

    This paper studies the iteration-complexity of a new primal-dual algorithm based on Rockafellar’s proximal method of multipliers (PMM) for solving smooth convex programming problems with inequality constraints. In each step, either a step of Rockafellar’s PMM for a second-order model of the problem is computed or a relaxed extragradient step is performed. The resulting algorithm … Read more

    Regularized HPE-type methods for solving monotone inclusions with improved pointwise iteration-complexity bounds

  • M. Marques Alves
  • Renato D.C. Monteiro
  • Benar Fux Svaiter
    • Categories Convex and Nonsmooth Optimization Tags , , ,

    This paper studies the iteration-complexity of new regularized hybrid proximal extragradient (HPE)-type methods for solving monotone inclusion problems (MIPs). The new (regularized HPE-type) methods essentially consist of instances of the standard HPE method applied to regularizations of the original MIP. It is shown that its pointwise iteration-complexity considerably improves the one of the HPE method … Read more

    A dynamic approach to a proximal-Newton method for monotone inclusions in Hilbert spaces, with complexity $\bigo(1/n^2)$

  • M. Marques Alves
  • Hédy Attouch
  • Benar Fux Svaiter
    • Categories Convex and Nonsmooth Optimization

    In a Hilbert setting, we introduce a new dynamic system and associated algorithms aimed at solving by rapid methods, monotone inclusions. Given a maximal monotone operator $A$, the evolution is governed by the time dependent operator $I -(I + \lambda(t) {A})^{-1}$, where, in the resolvent, the positive control parameter $\lambda(t)$ tends to infinity as $t … Read more