Robustness of the hybrid extragradient proximal-point algorithm.

DOI10.1023/A:1017523331361zbMath1054.90088WikidataQ58048630 ScholiaQ58048630MaRDI QIDQ5958079

Regina Sandra Burachik, Susana Scheimberg, Benar Fux Svaiter

Publication date: 15 October 2002

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

extragradient methodsmomotone operatorsproximal point algorithms

Mathematics Subject Classification ID

Programming in abstract spaces (90C48)

Related Items (11)

Approximate proximal methods in vector optimization ⋮ Convergence rates with inexact non-expansive operators ⋮ Iterative Methods for the Elastography Inverse Problem of Locating Tumors ⋮ A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives ⋮ Convergence of a proximal point algorithm for maximal monotone operators in Hilbert spaces ⋮ Hybrid approximate proximal method with auxiliary variational inequality for vector optimization ⋮ Enlargements: a bridge between maximal monotonicity and convexity ⋮ 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 ⋮ Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization ⋮ New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite termination of the proximal point algorithm
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Enlargement of monotone operators with applications to variational inequalities
• A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• Error bounds for proximal point subproblems and associated inexact proximal point algorithms
• \(\varepsilon\)-enlargements of maximal monotone operators in Banach spaces
• Asymptotic Convergence Analysis of the Proximal Point Algorithm
• Variational principles for variational inequalities
• New Proximal Point Algorithms for Convex Minimization
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Generalized equations and their solutions, Part I: Basic theory
• Variational Analysis
• Numerical methods for nondifferentiable convex optimization
• On the Subdifferentiability of Convex Functions
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• On the Maximality of Sums of Nonlinear Monotone Operators

This page was built for publication: Robustness of the hybrid extragradient proximal-point algorithm.