Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
From MaRDI portal
DOI10.1137/S1052623495279797zbMATH Open0914.90218MaRDI QIDQ4376149FDOQ4376149
Authors: Paul Tseng 
Publication date: 10 February 1998
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Recommendations
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- An improved proximal-based decomposition method for structured monotone variational inequalities
- A new inexact alternating directions method for monotone variational inequalities
- A class of variable metric decomposition methods for monotone variational inclusions
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
error boundmaximal monotone operatorproximal point methodmonotone variational inequalitylinear convergenceprojection-type method
Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Variational inequalities (49J40)
Cited In (75)
- Alternating proximal algorithm for the problem of bi-level convex minimization
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms
- A variational approach to the alternating projections method
- Title not available (Why is that?)
- On alternating direction method for solving variational inequality problems with separable structure
- Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design
- SQP alternating direction method with a new optimal step size for solving variational inequality problems with separable structure
- A self-adaptive descent LQP alternating direction method for the structured variational inequalities
- Decomposition methods based on augmented Lagrangians: a survey
- A novel approach for solving semidefinite programs
- A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- Strong convergence theorems of the \(C Q\) algorithm for \(H\)-monotone operators in Hilbert spaces
- A parallel splitting method for separable convex programs
- The hybrid proximal decomposition method applied to the computation of a Nash equilibrium for hydrothermal electricity markets
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- A new parallel splitting augmented Lagrangian-based method for a Stackelberg game
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A new decomposition method for variational inequalities with linear constraints
- The generalized relaxed proximal point algorithm involving A-maximal-relaxed accretive mappings with applications to Banach spaces
- Proximal Decomposition on the Graph of a Maximal Monotone Operator
- Fast inexact decomposition algorithms for large-scale separable convex optimization
- Proximal-point algorithm using a linear proximal term
- A hybrid splitting method for variational inequality problems with separable structure
- Low complexity regularization of linear inverse problems
- General over-relaxed proximal point algorithm involving \(A\)-maximal relaxed monotone mappings with applications
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
- Lagrangian penalization scheme with parallel forward-backward splitting
- Interior projection-like methods for monotone variational inequalities
- On variable-step relaxed projection algorithm for variational inequalities
- New decomposition methods for solving variational inequality problems.
- An asymmetric proximal decomposition method for convex programming with linearly coupling constraints
- Role of relative \(A\)-maximal monotonicity in overrelaxed proximal-point algorithms with Applications
- Convergence rates with inexact non-expansive operators
- New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems
- Alternating direction method for covariance selection models
- A new implementable prediction-correction method for monotone variational inequalities with separable structure
- An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
- Local convergence analysis of projection-type algorithms: unified approach
- An improved prediction-correction method for monotone variational inequalities with separable operators
- Alternating proximal gradient method for convex minimization
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- On Rockafellar's theorem using proximal point algorithm involving \(H\)-maximal monotonicity framework
- An augmented Lagrangian-based parallel splitting method for a one-leader-two-follower game
- An improved proximal alternating direction method for monotone variational inequalities with separable structure
- An alternating direction method for second-order conic programming
- A new relaxed proximal point procedure and applications to nonlinear variational inclusions
- On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure
- Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework
- Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions
- Proximal alternating directions method for structured variational inequalities
- On general variable-step relaxed projection method for strongly quasivariational inequalities
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- An alternating direction method for Nash equilibrium of two-person games with alternating offers
- An alternating direction-based contraction method for linearly constrained separable convex programming problems
- An alternating direction method for convex quadratic second-order cone programming with bounded constraints
- A new descent alternating direction method with LQP regularization for the structured variational inequalities
- A relaxed projection method for split variational inequalities
- Generalized over-relaxed proximal algorithm based ona-maximal monotonicity framework and applications to inclusion problems
- A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
- Convergence analysis of the generalized alternating direction method of multipliers with logarithmic-quadratic proximal regularization
- Smoothing proximal gradient method for general structured sparse regression
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
- A class of Dantzig-Wolfe type decomposition methods for variational inequality problems
- The over-relaxed proximal point algorithm based on \(H\)-maximal monotonicity design and applications
- Some recent advances in projection-type methods for variational inequalities
- A class of nonlinear proximal point algorithms for variational inequality problems
- Iterative methods for the elastography inverse problem of locating tumors
- An improved proximal-based decomposition method for structured monotone variational inequalities
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Block coordinate descent methods for semidefinite programming
- A line-search-based partial proximal alternating directions method for separable convex optimization
- A new alternating projection-based prediction-correction method for structured variational inequalities
This page was built for publication: Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376149)
