A descent method for structured monotone variational inequalities
From MaRDI portal
Publication:5758226
DOI10.1080/10556780600552693zbMath1196.90118OpenAlexW1985812215MaRDI QIDQ5758226
Publication date: 3 September 2007
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780600552693
Numerical optimization and variational techniques (65K10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (29)
A survey on some recent developments of alternating direction method of multipliers ⋮ Fiber Orientation Distribution Estimation Using a Peaceman--Rachford Splitting Method ⋮ An alternating direction method for second-order conic programming ⋮ Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm ⋮ A partial parallel splitting augmented Lagrangian method for solving constrained matrix optimization problems ⋮ Alternating direction augmented Lagrangian methods for semidefinite programming ⋮ Partial convolution for total variation deblurring and denoising by new linearized alternating direction method of multipliers with extension step ⋮ An extended linearized alternating direction method of multipliers for fused-Lasso penalized linear regression ⋮ Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization ⋮ Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing ⋮ A homotopy alternating direction method of multipliers for linearly constrained separable convex optimization ⋮ A new alternating projection-based prediction–correction method for structured variational inequalities ⋮ Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems ⋮ Deblurring Poisson noisy images by total variation with overlapping group sparsity ⋮ On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers ⋮ A new self-adaptive alternating direction method for variational inequality problems with linear equality and inequality constraints ⋮ An efficient simultaneous method for the constrained multiple-sets split feasibility problem ⋮ An improved proximal alternating direction method for monotone variational inequalities with separable structure ⋮ A simple and feasible method for a class of large-scale \(l^1\)-problems ⋮ On the convergence analysis of the alternating direction method of multipliers with three blocks ⋮ Alternating direction method for covariance selection models ⋮ An accelerated active-set algorithm for a quadratic semidefinite program with general constraints ⋮ Block Coordinate Descent Methods for Semidefinite Programming ⋮ Decomposition of longitudinal deformations via Beltrami descriptors ⋮ An alternating direction-based contraction method for linearly constrained separable convex programming problems ⋮ An improved contraction method for structured monotone variational inequalities ⋮ Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata ⋮ A proximal partially parallel splitting method for separable convex programs ⋮ Alternating direction method for the high-order total variation-based Poisson noise removal problem
Cites Work
- Unnamed Item
- Unnamed Item
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Application of the alternating direction method of multipliers to separable convex programming problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
- A proximal-based deomposition method for compositions method for convex minimization problems
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- A new inexact alternating directions method for monotone variational inequalities
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
This page was built for publication: A descent method for structured monotone variational inequalities
