INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES

DOI10.1081/NFA-100105310zbMath1018.90067OpenAlexW2046641376MaRDI QIDQ2769521

Rolando Gárciga Otero, Alfredo Noel Iusem

Publication date: 15 September 2003

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1081/nfa-100105310

zbMATH Keywords

maximal monotone operatoraugmented Lagrangianinexact solutionsBregman projectionproximal point method

Mathematics Subject Classification ID

Convex programming (90C25) Variational inequalities (49J40) Programming in abstract spaces (90C48) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Related Items

Proximal Methods with Penalization Effects in Banach Spaces ⋮ A double projection algorithm for quasimonotone variational inequalities in Banach spaces ⋮ Forcing strong convergence of Korpelevich's method in Banach spaces with its applications in game theory ⋮ An explicit extragradient algorithm for solving variational inequality problem with application ⋮ Proximal methods in reflexive Banach spaces without monotonicity ⋮ An efficient projection-type method for monotone variational inequalities in Hilbert spaces ⋮ Weak and strong convergence theorems for solving pseudo-monotone variational inequalities with non-Lipschitz mappings ⋮ A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors ⋮ Analysis of two versions of relaxed inertial algorithms with Bregman divergences for solving variational inequalities ⋮ A proximal augmented Lagrangian method for equilibrium problems ⋮ Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces ⋮ On a modified extragradient method for variational inequality problem with application to industrial electricity production ⋮ Strong convergence of modified inertial extragradient methods for non-Lipschitz continuous variational inequalities and fixed point problems ⋮ A new modified extragradient method with line-search process for solving pseudomonotone variational inequality in Hilbert spaces ⋮ Novel projection methods for solving variational inequality problems and applications ⋮ Inertial iterative method for solving variational inequality problems of pseudo-monotone operators and fixed point problems of nonexpansive mappings in Hilbert spaces ⋮ Proximal Point Method for Quasi-Equilibrium Problems in Banach Spaces ⋮ Fast and simple Bregman projection methods for solving variational inequalities and related problems in Banach spaces ⋮ Extragradient methods for solving non-Lipschitzian pseudo-monotone variational inequalities ⋮ A strongly convergent hybrid proximal method in Banach spaces. ⋮ Unnamed Item ⋮ Iterative method with inertial for variational inequalities in Hilbert spaces ⋮ Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods ⋮ Strong convergence of a double projection-type method for monotone variational inequalities in Hilbert spaces ⋮ Outer approximation schemes for generalized semi-infinite variational inequality problems ⋮ Korpelevich's method for variational inequality problems in Banach spaces ⋮ Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces ⋮ A proximal point method in nonreflexive Banach spaces ⋮ Augmented Lagrangian methods for variational inequality problems ⋮ Inexact Proximal Point Methods for Equilibrium Problems in Banach Spaces ⋮ Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization ⋮ Strong Convergence of an Inexact Proximal Point Algorithm for Equilibrium Problems in Banach Spaces ⋮ New algorithms and convergence theorems for solving variational inequalities with non-Lipschitz mappings ⋮ Iterative algorithms for solving fixed point problems and variational inequalities with uniformly continuous monotone operators ⋮ Strong convergence theorems for solving variational inequality problems with pseudo-monotone and non-Lipschitz operators ⋮ An inertial extrapolation method for solving generalized split feasibility problems in real Hilbert spaces ⋮ Strong convergence of the modified inertial extragradient method with line-search process for solving variational inequality problems in Hilbert spaces ⋮ A new iterative method for solving pseudomonotone variational inequalities with non-Lipschitz operators ⋮ Modified Tseng's extragradient methods for solving pseudo-monotone variational inequalities ⋮ Convergence of a hybrid projection algorithm in Banach spaces ⋮ Convergence analysis of projection method for variational inequalities ⋮ Inertial Tseng's extragradient method for solving variational inequality problems of pseudo-monotone and non-Lipschitz operators ⋮ Extragradient method with Bregman distances for solving vector quasi-equilibrium problems ⋮ Weak convergence for variational inequalities with inertial-type method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Auxiliary problem principle and decomposition of optimization problems
• The non-existence of smooth demand in general Banach spaces
• A logarithmic-quadratic proximal method for variational inequalities
• Proximal minimization algorithm with \(D\)-functions
• Enlargement of monotone operators with applications to variational inequalities
• On some properties of generalized proximal point methods for variational inequalities
• Steepest descent methods for multicriteria optimization.
• Totally convex functions for fixed points computation and infinite dimensional optimization
• A proximal point method for nonsmooth convex optimization problems in Banach spaces
• Some properties of generalized proximal point methods for quadratic and linear programming
• Multiplier and gradient methods
• The multiplier method of Hestenes and Powell applied to convex programming
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• On Penalty and Multiplier Methods for Constrained Minimization
• Combined Primal–Dual and Penalty Methods for Convex Programming
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Proximal Minimization Methods with Generalized Bregman Functions
• On a proximal point method for convex optimization in banach spaces
• A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Entropy-Like Proximal Methods in Convex Programming
• Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
• Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels

This page was built for publication: INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES