Enlargement of monotone operators with applications to variational inequalities
From MaRDI portal
Publication:1364815
DOI10.1023/A:1008615624787zbMath0882.90105MaRDI QIDQ1364815
Alfredo Noel Iusem, Regina Sandra Burachik, Benar Fux Svaiter
Publication date: 28 August 1997
Published in: Set-Valued Analysis (Search for Journal in Brave)
variational inequalitiesconvex optimizationmonotone operators\(\varepsilon\)-subdifferentialpoint-to-set operatorproximal point methods
Related Items
A strong convergence theorem for solving the split feasibility and fixed point problems in Banach spaces, Another proof and a generalization of a theorem of H. H. Bauschke on monotone operators, A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator, A proximal method with logarithmic barrier for nonlinear complementarity problems, The relevance of convex analysis for the study of monotonicity, Approximate proximal methods in vector optimization, A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities, A Hybrid Proximal-Extragradient Algorithm with Inertial Effects, Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA, A new inertial-type hybrid projection-proximal algorithm for monotone inclusions, Enlargement of monotone vector fields and an inexact proximal point method for variational inequalities in Hadamard manifolds, 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, On Bregman-type distances for convex functions and maximally monotone operators, The developments of proximal point algorithms, A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives, Approximating zeros of monotone operators by proximal point algorithms, On the complexity of the projective splitting and Spingarn's methods for the sum of two maximal monotone operators, Strong convergence of a hybrid projection iterative algorithm for common solutions of operator equations and of inclusion problems, Hybrid approximate proximal method with auxiliary variational inequality for vector optimization, Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant, Accelerated schemes for a class of variational inequalities, A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization, On a sufficient condition for equality of two maximal monotone operators, A first-order block-decomposition method for solving two-easy-block structured semidefinite programs, On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects, On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems, An approximate proximal point algorithm for maximal monotone inclusion problems, Iterative approaches to find zeros of maximal monotone operators by hybrid approximate proximal point methods, A weakly convergent fully inexact Douglas-Rachford method with relative error tolerance, A shrinking projection method for solving the split common null point problem in Banach spaces, An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization, Principled analyses and design of first-order methods with inexact proximal operators, An additive subfamily of enlargements of a maximally monotone operator, Enlargements: a bridge between maximal monotonicity and convexity, Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework, A new predicto-corrector method for pseudomonotone nonlinear complementarity problems, Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems, Re-examination of Bregman functions and new properties of their divergences, An extragradient-type algorithm for variational inequality on Hadamard manifolds, Unnamed Item, An extragradient-type algorithm for non-smooth variational inequalities, A strongly convergent hybrid proximal method in Banach spaces., A class of Fejér convergent algorithms, approximate resolvents and the hybrid proximal-extragradient method, On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators, Convergence Rate of $\mathcal{O}(1/k)$ for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems, \(\varepsilon \)-subdifferential as an enlargement of the subdifferential, On the difference of two maximal monotone operators: Regularization and algorithmic approaches, A generalized proximal-point-based prediction-correction method for variational inequality problems, Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods, A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework, The hybrid proximal decomposition method applied to the computation of a Nash equilibrium for hydrothermal electricity markets, Extragradient Method with Variance Reduction for Stochastic Variational Inequalities, INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES, On the representation of approximate subdifferentials for a class of generalized convex functions, Extended auxiliary problem principle using Bregman distances, A new proximal-based globalization strategy for the Josephy‐Newton method for variational inequalities, A relaxed approximate proximal point algorithm, Convergence analysis of a relaxed extragradient–proximal point algorithm application to variational inequalities, A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*, Eigenvalues of set-valued operators in Banach spaces, Monotone operators representable by l.s.c. convex functions, Modified approximate proximal point algorithms for finding roots of maximal monotone operators, Bregman-like functions and proximal methods for variational problems with nonlinear constraints, Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization, A new accuracy criterion for approximate proximal point algorithms, Enlargements and sums of monotone operators, Robustness of the hybrid extragradient proximal-point algorithm., A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems, Lagrangian penalization scheme with parallel forward-backward splitting, Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers, Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods, A new logarithmic-quadratic proximal method for nonlinear complementarity problems, An application of the bivariate inf-convolution formula to enlargements of monotone operators, Interior hybrid proximal extragradient methods for the linear monotone complementarity problem, Enlargements of the Moreau-Rockafellar subdifferential, Convergence of a splitting inertial proximal method for monotone operators, An inexact method of partial inverses and a parallel bundle method, Enlargements of positive sets, Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations, 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, 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, Approximate iterations in Bregman-function-based proximal algorithms, An Accelerated Linearized Alternating Direction Method of Multipliers, Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds, Two strong convergence theorems for the common null point problem in Banach spaces, The indefinite proximal point algorithms for maximal monotone operators, A partially inexact ADMM with o(1/n) asymptotic convergence rate, 𝒪(1/n) complexity, and immediate relative error tolerance, On the need for hybrid steps in hybrid proximal point methods, An Optimal High-Order Tensor Method for Convex Optimization, A variant of the hybrid proximal extragradient method for solving strongly monotone inclusions and its complexity analysis
