An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions

DOI10.1287/MOOR.25.2.214.12222zbMath0980.90097OpenAlexW2164224215MaRDI QIDQ2757632

Benar Fux Svaiter, Mikhail V. Solodov

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c6dee79966c4a90cb0da04c6c89b38005c1a6fd0

zbMATH Keywords

maximal monotone operatorBregman distancevariational inequality problemsBregman functionsgeneralized proximal point methodproximal subproblems

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Mathematical programming (90C99)

Related Items (only showing first 100 items - show all)

Principled analyses and design of first-order methods with inexact proximal operators ⋮ Bregman proximal point type algorithms for quasiconvex minimization ⋮ SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization ⋮ Some new extragradient-like methods for generalized equilibrium problems, fixed point problems and variational inequality problems ⋮ Hybrid iterative algorithms for two families of finite maximal monotone mappings ⋮ Approximate proximal methods in vector optimization ⋮ A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities ⋮ Steered sequential projections for the inconsistent convex feasibility problem ⋮ Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems ⋮ Entropic Approximation of Wasserstein Gradient Flows ⋮ Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods ⋮ A new approximation scheme combining the viscosity method with extragradient method for mixed equilibrium problems ⋮ Strong convergence theorems for equilibrium problems and weak Bregman relatively nonexpansive mappings in Banach spaces ⋮ Implicit iterative algorithms for asymptotically nonexpansive mappings in the intermediate sense and Lipschitz-continuous monotone mappings ⋮ An inexact proximal method for quasiconvex minimization ⋮ An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems ⋮ Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework ⋮ The developments of proximal point algorithms ⋮ Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM ⋮ Approximating zeros of monotone operators by proximal point algorithms ⋮ Proximal methods in reflexive Banach spaces without monotonicity ⋮ Hybrid approximate proximal method with auxiliary variational inequality for vector optimization ⋮ A practical relative error criterion for augmented Lagrangians ⋮ An inexact algorithm with proximal distances for variational inequalities ⋮ Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant ⋮ Accelerated schemes for a class of variational inequalities ⋮ New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems ⋮ A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors ⋮ Hybrid extragradient method for generalized mixed equilibrium problems and fixed point problems in Hilbert space ⋮ Approximate ADMM algorithms derived from Lagrangian splitting ⋮ Inexact alternating direction methods of multipliers for separable convex optimization ⋮ An interior proximal method for a class of quasimonotone variational inequalities ⋮ On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects ⋮ 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 ⋮ An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization ⋮ Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework ⋮ Proximal Point Method for Quasi-Equilibrium Problems in Banach Spaces ⋮ Approximation of fixed points of weak Bregman relatively nonexpansive mappings in Banach spaces ⋮ Bregman three-operator splitting methods ⋮ Hybrid extragradient iterative algorithms for variational inequalities, variational inclusions, and fixed-point problems ⋮ Re-examination of Bregman functions and new properties of their divergences ⋮ Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. ⋮ Pseudomonotone operators and the Bregman proximal point algorithm ⋮ A strongly convergent hybrid proximal method in Banach spaces. ⋮ On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators ⋮ Approximate proximal algorithms for generalized variational inequalities with paramonotonicity and pseudomonotonicity ⋮ Interior proximal method without the cutting plane property ⋮ Unnamed Item ⋮ The Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion ⋮ Mann-type algorithms for variational inequality problems and fixed point problems ⋮ On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm ⋮ Nonlinear Forward-Backward Splitting with Projection Correction ⋮ An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming ⋮ An implicit iterative scheme for monotone variational inequalities and fixed point problems ⋮ A generalized proximal-point-based prediction-correction method for variational inequality problems ⋮ An inexact alternating direction method of multipliers with relative error criteria ⋮ On inexact ADMMs with relative error criteria ⋮ On inexact generalized proximal methods with a weakened error tolerance criterion ⋮ Approximate proximal algorithms for generalized variational inequalities with pseudomonotone multifunctions ⋮ Efficient alternating minimization methods for variational edge-weighted colorization models ⋮ Strong convergence theorem by a hybrid extragradient-like approximation method for variational inequalities and fixed point problems ⋮ Proximal methods for nonlinear programming: Double regularization and inexact subproblems ⋮ Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces ⋮ Interior proximal method for variational inequalities: Case of nonparamonotone operators ⋮ Interior Proximal Methods for equilibrium programming: part II ⋮ An interior proximal point algorithm for nonlinear complementarity problems ⋮ Two extragradient methods for generalized mixed equilibrium problems, nonexpansive mappings and monotone mappings ⋮ Pseudomonotone\(_*\) maps and the cutting plane property ⋮ A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS^* ⋮ Convergence rates for an inexact ADMM applied to separable convex optimization ⋮ 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 ⋮ Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators ⋮ A new logarithmic-quadratic proximal method for nonlinear complementarity problems ⋮ Strong convergence theorems of iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems ⋮ A parameterized proximal point algorithm for separable convex optimization ⋮ Bregman functions and auxiliary problem principle ⋮ Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design ⋮ WEAK CONVERGENCE OF AN ITERATIVE SCHEME FOR GENERALIZED EQUILIBRIUM PROBLEMS ⋮ On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM ⋮ An inexact method of partial inverses and a parallel bundle method ⋮ An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels ⋮ On Rockafellar's theorem using proximal point algorithm involving \(H\)-maximal monotonicity framework ⋮ An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems ⋮ A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems ⋮ Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions ⋮ A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant ⋮ 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 ⋮ An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems ⋮ Convergence analysis of an inexact three-operator splitting algorithm ⋮ On a generalization of paramonotone maps and its application to solving the Stampacchia variational inequality ⋮ The indefinite proximal point algorithms for maximal monotone operators ⋮ Complexity and performance of an Augmented Lagrangian algorithm ⋮ On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming ⋮ A partially inexact ADMM with o(1/n) asymptotic convergence rate, 𝒪(1/n) complexity, and immediate relative error tolerance ⋮ Nonlinear proximal decomposition method for convex programming

This page was built for publication: An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions