A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
From MaRDI portal
Publication:1570036
DOI10.1023/A:1008777829180zbMath0959.90038OpenAlexW2138216979MaRDI QIDQ1570036
Mikhail V. Solodov, Benar Fux Svaiter
Publication date: 2 May 2001
Published in: Set-Valued Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008777829180
maximal monotone operatorextragradient methodproximal point methodenlargement of a maximal monotone operator
Related Items (only showing first 100 items - show all)
Some recent advances in projection-type methods for variational inequalities ⋮ New properties of forward-backward splitting and a practical proximal-descent algorithm ⋮ A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator ⋮ Strict convex regularizations, proximal points and augmented lagrangians ⋮ Regularization proximal method for monotone variational inclusions ⋮ Approximate proximal methods in vector optimization ⋮ A survey on some recent developments of alternating direction method of multipliers ⋮ A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities ⋮ Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems ⋮ A Hybrid Proximal-Extragradient Algorithm with Inertial Effects ⋮ Iteration-complexity analysis of a generalized alternating direction method of multipliers ⋮ Proximal algorithm for solving monotone variational inclusion ⋮ Convergence rates with inexact non-expansive operators ⋮ A new inertial-type hybrid projection-proximal algorithm for monotone inclusions ⋮ An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems ⋮ Parallel iterative methods for solving the common null point problem in Banach spaces ⋮ The developments of proximal point algorithms ⋮ Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle ⋮ A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives ⋮ A framework for analyzing local convergence properties with applications to proximal-point algorithms ⋮ On the complexity of the projective splitting and Spingarn's methods for the sum of two maximal monotone operators ⋮ Hybrid approximate proximal method with auxiliary variational inequality for vector optimization ⋮ Hybrid proximal point algorithm and applications to equilibrium problems and convex programming ⋮ A practical relative error criterion for augmented Lagrangians ⋮ Backward-forward algorithms for structured monotone inclusions in Hilbert spaces ⋮ An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems ⋮ Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm ⋮ A direct splitting method for nonsmooth variational inequalities ⋮ A first-order block-decomposition method for solving two-easy-block structured semidefinite programs ⋮ Convergence rates of accelerated proximal gradient algorithms under independent noise ⋮ On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects ⋮ An inexact proximal generalized alternating direction method of multipliers ⋮ On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems ⋮ An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization ⋮ Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods ⋮ A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization ⋮ Dual convergence for penalty algorithms in convex programming ⋮ On the computation of equilibria in monotone and potential stochastic hierarchical games ⋮ Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework ⋮ New decomposition methods for solving variational inequality problems. ⋮ Inertial projection and contraction algorithms for variational inequalities ⋮ A proximal decomposition algorithm for variational inequality problems. ⋮ On FISTA with a relative error rule ⋮ Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems ⋮ A hybrid inertial and contraction proximal point algorithm for monotone variational inclusions ⋮ Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's ⋮ A strongly convergent hybrid proximal method in Banach spaces. ⋮ A class of Fejér convergent algorithms, approximate resolvents and the hybrid proximal-extragradient method ⋮ Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano ⋮ An inexact proximal point algorithm for maximal monotone vector fields on Hadamard manifolds ⋮ On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators ⋮ Inexact operator splitting methods with selfadaptive strategy for variational inequality problems ⋮ A new splitting method for monotone inclusions of three operators ⋮ A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality ⋮ A proximal-Newton method for unconstrained convex optimization in Hilbert spaces ⋮ A family of projective splitting methods for the sum of two maximal monotone operators ⋮ An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming ⋮ A new generalized APPA for maximal monotone operators ⋮ An inexact alternating direction method of multipliers with relative error criteria ⋮ An extragradient-based alternating direction method for convex minimization ⋮ Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods ⋮ On inexact ADMMs with relative error criteria ⋮ A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework ⋮ Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems ⋮ A note on Solodov and Tseng's methods for maximal monotone mappings ⋮ Extended auxiliary problem principle using Bregman distances ⋮ Proximal methods for nonlinear programming: Double regularization and inexact subproblems ⋮ A new proximal-based globalization strategy for the Josephy‐Newton method for variational inequalities ⋮ Convergence analysis of a relaxed extragradient–proximal point algorithm application to variational inequalities ⋮ A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS* ⋮ Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization ⋮ Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators ⋮ Rate of convergence for proximal point algorithms on Hadamard manifolds ⋮ A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems ⋮ Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers ⋮ New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints ⋮ A variable metric proximal-descent algorithm for monotone operators ⋮ Projection iterative method for solving general variational inequalities ⋮ Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods ⋮ On the proximal point method for equilibrium problems in Hilbert spaces ⋮ Interior hybrid proximal extragradient methods for the linear monotone complementarity problem ⋮ Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms ⋮ An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems ⋮ Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms ⋮ A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems ⋮ A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis ⋮ The extragradient algorithm with inertial effects for solving the variational inequality ⋮ 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 ⋮ A new duality theory for mathematical programming ⋮ Outer Approximation Method for Constrained Composite Fixed Point Problems Involving Lipschitz Pseudo Contractive Operators ⋮ Optimization and learning with nonlocal calculus ⋮ An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems ⋮ A control-theoretic perspective on optimal high-order optimization ⋮ Two strong convergence theorems for the common null point problem in Banach spaces ⋮ The indefinite proximal point algorithms for maximal monotone operators ⋮ On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators ⋮ On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming ⋮ An inexact ADMM with proximal-indefinite term and larger stepsize ⋮ On the need for hybrid steps in hybrid proximal point methods ⋮ A variant of the hybrid proximal extragradient method for solving strongly monotone inclusions and its complexity analysis
This page was built for publication: A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
