A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*

DOI10.1081/NFA-100108320zbMath1052.49013MaRDI QIDQ2785250

Benar Fux Svaiter, Mikhail V. Solodov

Publication date: 2001

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

zbMATH Keywords

nonlinear complementarity problemmaximal monotone operator, proximal point algorithm, approximation criteria

Mathematics Subject Classification ID

Convex programming (90C25) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Programming in abstract spaces (90C48) Numerical solutions to equations with nonlinear operators (65J15)

Related Items (81)

A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator ⋮ Local convergence of tensor methods ⋮ An additional projection step to He and Liao's method for solving variational inequalities ⋮ A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities ⋮ New inexact implicit method for general mixed quasi variational inequalities ⋮ Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems ⋮ Some proximal algorithms for linearly constrained general variational inequalities ⋮ A projective splitting algorithm for solving generalized mixed variational inequalities ⋮ A new inertial-type hybrid projection-proximal algorithm for monotone inclusions ⋮ Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods ⋮ Modified descent-projection method for solving variational inequalities ⋮ Inexact proximal point method for general variational inequalities ⋮ The prediction-correction approach to nonlinear complementarity problems ⋮ Global convergence of a proximal linearized algorithm for difference of convex functions ⋮ Uniformity and inexact version of a proximal method for metrically regular mappings ⋮ An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems ⋮ SOME NEW RESOLVENT METHODS FOR SOLVING GENERAL MIXED VARIATIONAL INEQUALITIES ⋮ ON A NEW NUMERICAL METHOD FOR SOLVING GENERAL VARIATIONAL INEQUALITIES ⋮ An inexact implicit method for general mixed variational inequalities ⋮ The developments of proximal point algorithms ⋮ Three-steps iterative algorithms for mixed variational inequalities ⋮ On finite termination of an inexact proximal point algorithm ⋮ On the complexity of the projective splitting and Spingarn's methods for the sum of two maximal monotone operators ⋮ Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant ⋮ A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors ⋮ A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization ⋮ Descentwise inexact proximal algorithms for smooth optimization ⋮ On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects ⋮ Unnamed Item ⋮ On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems ⋮ Rate of convergence of the Nesterov accelerated gradient method in the subcritical case α ≤ 3 ⋮ A weakly convergent fully inexact Douglas-Rachford method with relative error tolerance ⋮ A modified proximal point algorithm with errors for approximating solution of the general variational inclusion ⋮ 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 ⋮ Principled analyses and design of first-order methods with inexact proximal operators ⋮ An inexact hybrid projection-proximal point algorithm for solving generalized mixed variational inequalities ⋮ On High-order Model Regularization for Constrained Optimization ⋮ Maximal monotone operators and the proximal point algorithm in the presence of computational errors ⋮ A projection-proximal point algorithm for solving generalized variational inequalities ⋮ A class of Dantzig-Wolfe type decomposition methods for variational inequality problems ⋮ Rate of convergence of inertial gradient dynamics with time-dependent viscous damping coefficient ⋮ Unnamed Item ⋮ 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 ⋮ On convergence criteria of generalized proximal point algorithms ⋮ Contracting Proximal Methods for Smooth Convex Optimization ⋮ An improved proximal-based decomposition method for structured monotone variational inequalities ⋮ Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods ⋮ 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 ⋮ Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice ⋮ A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework ⋮ A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm ⋮ A Lyusternik-Graves theorem for the proximal point method ⋮ The hybrid proximal decomposition method applied to the computation of a Nash equilibrium for hydrothermal electricity markets ⋮ Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems ⋮ 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 ⋮ New extragradient-type methods for solving variational inequalities ⋮ A modified inexact implicit method for mixed variational inequalities ⋮ Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization ⋮ A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems ⋮ Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods ⋮ Interior hybrid proximal extragradient methods for the linear monotone complementarity problem ⋮ Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms ⋮ Weak sharpness for set-valued variational inequalities and applications to finite termination of iterative algorithms ⋮ An inexact method of partial inverses and a parallel bundle method ⋮ Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations ⋮ Modified extragradient methods for solving variational inequalities ⋮ Proximal point algorithms for general variational inequalities ⋮ 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 ⋮ Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization ⋮ NEW THREE-STEP ITERATIVE METHOD FOR SOLVING MIXED VARIATIONAL INEQUALITIES ⋮ Convergence analysis of an inexact three-operator splitting algorithm ⋮ The indefinite proximal point algorithms for maximal monotone operators ⋮ Convergence Analysis of Inexact Randomized Iterative Methods ⋮ A partially inexact ADMM with o(1/n) asymptotic convergence rate, 𝒪(1/n) complexity, and immediate relative error tolerance ⋮ A class of nonlinear proximal point algorithms for variational inequality problems ⋮ A new incremental constraint projection method for solving monotone variational inequalities

Cites Work

• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• Approximate iterations in Bregman-function-based proximal algorithms
• Solving box constrained variational inequalities by using the natural residual with D-gap function globalization
• The perturbed proximal point algorithm and some of its applications
• Solution of monotone complementarity problems with locally Lipschitzian functions
• Enlargement of monotone operators with applications to variational inequalities
• Coupling the proximal point algorithm with approximation methods
• A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• A theoretical and numerical comparison of some semismooth algorithms for complementarity problems
• \(\varepsilon\)-enlargements of maximal monotone operators in Banach spaces
• Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
• A nonsmooth version of Newton's method
• Methodes itératives pour les équations et inéquations aux dérivées partielles non linéaires de type monotone. (Iteration methods for nonlinear equations and inequations with partial derivatives of monotone type)
• Monotonicity of Fixed Point and Normal Mappings Associated with Variational Inequality and Its Application
• An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
• Nonsmooth Equations: Motivation and Algorithms
• Optimization and nonsmooth analysis
• Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
• Inexact Newton Methods
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• An iterative solution of a variational inequality for certain monotone operators in Hilbert space
• Monotone Operators and the Proximal Point Algorithm
• Semismooth and Semiconvex Functions in Constrained Optimization
• A Variable Metric Proximal Point Algorithm for Monotone Operators
• A New Projection Method for Variational Inequality Problems
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• Inexact Newton methods for the nonlinear complementarity problem
• Co-Coercivity and Its Role in the Convergence of Iterative Schemes for Solving Variational Inequalities
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• A Truly Globally Convergent Newton-Type Method for the Monotone Nonlinear Complementarity Problem
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces

This page was built for publication: A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS^*