Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities

DOI10.1137/S1052623495279797zbMath0914.90218MaRDI QIDQ4376149

Paul Tseng

Publication date: 10 February 1998

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

maximal monotone operatorerror boundlinear convergenceproximal point methodmonotone variational inequalityprojection-type method

Mathematics Subject Classification ID

Convex programming (90C25) Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (66)

Some recent advances in projection-type methods for variational inequalities ⋮ A new parallel splitting augmented Lagrangian-based method for a Stackelberg game ⋮ Convergence rates with inexact non-expansive operators ⋮ Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ Iterative Methods for the Elastography Inverse Problem of Locating Tumors ⋮ Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework ⋮ An alternating direction method for second-order conic programming ⋮ Generalized over-relaxed proximal algorithm based ona-maximal monotonicity framework and applications to inclusion problems ⋮ An alternating direction method for Nash equilibrium of two-person games with alternating offers ⋮ Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems ⋮ An alternating direction method for convex quadratic second-order cone programming with bounded constraints ⋮ A parallel splitting method for separable convex programs ⋮ New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems ⋮ Alternating direction augmented Lagrangian methods for semidefinite programming ⋮ An augmented Lagrangian-based parallel splitting method for a one-leader-two-follower game ⋮ A new decomposition method for variational inequalities with linear constraints ⋮ General over-relaxed proximal point algorithm involving \(A\)-maximal relaxed monotone mappings with applications ⋮ New decomposition methods for solving variational inequality problems. ⋮ Smoothing proximal gradient method for general structured sparse regression ⋮ A class of Dantzig-Wolfe type decomposition methods for variational inequality problems ⋮ An asymmetric proximal decomposition method for convex programming with linearly coupling constraints ⋮ A new alternating projection-based prediction–correction method for structured variational inequalities ⋮ An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints ⋮ A self-adaptive descent LQP alternating direction method for the structured variational inequalities ⋮ Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization ⋮ Strong convergence theorems of the \(C Q\) algorithm for \(H\)-monotone operators in Hilbert spaces ⋮ On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure ⋮ On alternating direction method for solving variational inequality problems with separable structure ⋮ A new descent alternating direction method with LQP regularization for the structured variational inequalities ⋮ An improved proximal-based decomposition method for structured monotone variational inequalities ⋮ A relaxed projection method for split variational inequalities ⋮ The over-relaxed proximal point algorithm based on \(H\)-maximal monotonicity design and applications ⋮ SQP alternating direction method with a new optimal step size for solving variational inequality problems with separable structure ⋮ Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization ⋮ 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 ⋮ An improved proximal alternating direction method for monotone variational inequalities with separable structure ⋮ On variable-step relaxed projection algorithm for variational inequalities ⋮ The generalized relaxed proximal point algorithm involving A-maximal-relaxed accretive mappings with applications to Banach spaces ⋮ Convergence analysis of the generalized alternating direction method of multipliers with logarithmic-quadratic proximal regularization ⋮ Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization ⋮ A new relaxed proximal point procedure and applications to nonlinear variational inclusions ⋮ An improved prediction-correction method for monotone variational inequalities with separable operators ⋮ Alternating direction method for covariance selection models ⋮ Fast inexact decomposition algorithms for large-scale separable convex optimization ⋮ A simple algorithm for a class of nonsmooth convex-concave saddle-point problems ⋮ Lagrangian penalization scheme with parallel forward-backward splitting ⋮ Low Complexity Regularization of Linear Inverse Problems ⋮ Block Coordinate Descent Methods for Semidefinite Programming ⋮ Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design ⋮ Local convergence analysis of projection-type algorithms: unified approach ⋮ On Rockafellar's theorem using proximal point algorithm involving \(H\)-maximal monotonicity framework ⋮ Proximal-point algorithm using a linear proximal term ⋮ Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms ⋮ A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems ⋮ A new implementable prediction-correction method for monotone variational inequalities with separable structure ⋮ Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions ⋮ Role of relative \(A\)-maximal monotonicity in overrelaxed proximal-point algorithms with Applications ⋮ An alternating direction-based contraction method for linearly constrained separable convex programming problems ⋮ On general variable-step relaxed projection method for strongly quasivariational inequalities ⋮ Interior projection-like methods for monotone variational inequalities ⋮ A line-search-based partial proximal alternating directions method for separable convex optimization ⋮ A novel approach for solving semidefinite programs ⋮ A hybrid splitting method for variational inequality problems with separable structure ⋮ A class of nonlinear proximal point algorithms for variational inequality problems ⋮ Mirror Prox algorithm for multi-term composite minimization and semi-separable problems

This page was built for publication: Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities