A descent method for structured monotone variational inequalities
From MaRDI portal
Recommendations
- A descent alternating direction method for monotone variational inequalities with separable structure
- A two-stage descent method with optimal step-sizes for monotone variational inequality
- A descent LQP alternating direction method for solving variational inequality problems with separable structure
- A projection descent method for solving variational inequalities
- An APPA-based descent method with optimal step-sizes for monotone variational inequalities
Cites work
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A new inexact alternating directions method for monotone variational inequalities
- A proximal-based deomposition method for compositions method for convex minimization problems
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Application of the alternating direction method of multipliers to separable convex programming problems
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 3852340 (Why is no real title available?)
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
Cited in
(42)- A homotopy alternating direction method of multipliers for linearly constrained separable convex optimization
- Deblurring Poisson noisy images by total variation with overlapping group sparsity
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- 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
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
- Decomposition of longitudinal deformations via Beltrami descriptors
- A survey on some recent developments of alternating direction method of multipliers
- Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm
- A new self-adaptive alternating direction method for variational inequality problems with linear equality and inequality constraints
- Alternating direction method for covariance selection models
- Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata
- Alternating direction method for the high-order total variation-based Poisson noise removal problem
- Descent methods for a class of generalized variational inequalities
- Partial convolution for total variation deblurring and denoising by new linearized alternating direction method of multipliers with extension step
- Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization
- An APPA-based descent method with optimal step-sizes for monotone variational inequalities
- A two-stage descent method with optimal step-sizes for monotone variational inequality
- Block coordinate descent methods for semidefinite programming
- An alternating direction-based contraction method for linearly constrained separable convex programming problems
- Forward-backward-based descent methods for composite variational inequalities
- scientific article; zbMATH DE number 5912414 (Why is no real title available?)
- Fiber orientation distribution estimation using a Peaceman-Rachford splitting method
- An alternating direction method for second-order conic programming
- A new parallel splitting descent method for structured variational inequalities
- A descent alternating direction method for monotone variational inequalities with separable structure
- Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems
- On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers
- A proximal partially parallel splitting method for separable convex programs
- A new alternating projection-based prediction-correction method for structured variational inequalities
- An improved proximal alternating direction method for monotone variational inequalities with separable structure
- An improved contraction method for structured monotone variational inequalities
- An LQP-based descent method for structured monotone variational inequalities
- A partial parallel splitting augmented Lagrangian method for solving constrained matrix optimization problems
- An extended linearized alternating direction method of multipliers for fused-Lasso penalized linear regression
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A version of the mirror descent method to solve variational inequalities
- A new linearized alternating direction method of multipliers with adaptive step size and its inexact version for fused Lasso regression model
- An efficient simultaneous method for the constrained multiple-sets split feasibility problem
- A trust-region-based splitting method for optimization problems with linear constraints
- A descent algorithm for solving monotone variational inequalities and monotone complementarity problems
- New parallel descent-like method for solving a class of variational inequalities
This page was built for publication: A descent method for structured monotone variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5758226)
