Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
From MaRDI portal
Publication:3977035
DOI10.1137/0329006zbMATH Open0737.90048OpenAlexW1970986119MaRDI QIDQ3977035FDOQ3977035
Authors: Paul Tseng 
Publication date: 25 June 1992
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/3103
Recommendations
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Splitting algorithms for general pseudomonotone mixed variational inequalities
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
augmented Lagrangianmaximal monotone operatorsreal Hilbert spacesalternating minimizationcontinuous linear operators
Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Variational inequalities (49J40) Programming in abstract spaces (90C48)
Cited In (only showing first 100 items - show all)
- On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming
- Outer Approximation Method for Constrained Composite Fixed Point Problems Involving Lipschitz Pseudo Contractive Operators
- Linearized proximal alternating minimization algorithm for motion deblurring by nonlocal regularization
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
- A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
- An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
- Benders decomposition for a class of variational inequalities
- Approximations in proximal bundle methods and decomposition of convex programs
- Newton's method for quadratic stochastic programs with recourse
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A parallel inexact Newton method for stochastic programs with recourse
- Forward-backward splitting methods for accretive operators in Banach spaces
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Minimization of equilibrium problems, variational inequality problems and fixed point problems
- Operator splittings, Bregman methods and frame shrinkage in image processing
- First-order methods for convex optimization
- Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
- Convex Hodge decomposition and regularization of image flows
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
- Application of the alternating direction method of multipliers to separable convex programming problems
- A projected subgradient method for solving generalized mixed variational inequalities
- Proximal splitting methods in signal processing
- Split Bregman iteration algorithm for total bounded variation regularization based image deblurring
- A proximal-based deomposition method for compositions method for convex minimization problems
- Bounding duality gap for separable problems with linear constraints
- Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
- Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators
- Vector network equilibrium problems with elastic demands
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
- Forward-partial inverse-forward splitting for solving monotone inclusions
- An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
- Stability and experimental comparison of prototypical iterative schemes for total variation regularized problems
- A Variable Metric Extension of the Forward–Backward–Forward Algorithm for Monotone Operators
- New decomposition methods for solving variational inequality problems.
- Convergence of a splitting inertial proximal method for monotone operators
- Visco-penalization of the sum of two monotone operators
- An asymmetric proximal decomposition method for convex programming with linearly coupling constraints
- The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
- Algorithmic approach to a minimization problem
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- On preconditioned Uzawa methods and SOR methods for saddle-point problems
- Fifty years of maximal monotonicity
- New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems
- Multiplicative noise removal using L1 fidelity on frame coefficients
- Variable metric forward-backward splitting with applications to monotone inclusions in duality
- A family of operator splitting methods revisited
- A partial inexact alternating direction method for structured variational inequalities
- A splitting algorithm for coupled system of primal-dual monotone inclusions
- Decomposition method for a class of monotone variational inequality problems
- Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization
- Convergence of splitting algorithms for the sum of two accretive operators with applications
- A stochastic inertial forward–backward splitting algorithm for multivariate monotone inclusions
- Local convergence analysis of projection-type algorithms: unified approach
- A three-operator splitting scheme and its optimization applications
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
- On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems
- Nonlinear proximal decomposition method for convex programming
- Splitting-type method for systems of variational inequalities
- An improved proximal alternating direction method for monotone variational inequalities with separable structure
- An inertial forward-backward algorithm for monotone inclusions
- Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
- Random test problems and parallel methods for quadratic programs and quadratic stochastic programs∗
- Verification methods for nonlinear equations with saddle point functions
- Linearized alternating direction method for constrained linear least-squares problem.
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- Proximal alternating directions method for structured variational inequalities
- A descent method for structured monotone variational inequalities
- A note on the alternating direction method of multipliers
- Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
- Testable uniqueness conditions for empirical assessment of undersampling levels in total variation-regularized X-ray CT
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Convergence analysis of the generalized alternating direction method of multipliers with logarithmic-quadratic proximal regularization
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- An introduction to continuous optimization for imaging
- A class of Dantzig-Wolfe type decomposition methods for variational inequality problems
- Proximity for sums of composite functions
- Inducing sparsity via the horseshoe prior in imaging problems
- Some recent advances in projection-type methods for variational inequalities
- A Penalized Likelihood Method for Classification With Matrix-Valued Predictors
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- An Inexact Uzawa Algorithmic Framework for Nonlinear Saddle Point Problems with Applications to Elliptic Optimal Control Problem
- An alternating direction method of multipliers for elliptic equation constrained optimization problem
- Continuous dynamics related to monotone inclusions and non-smooth optimization problems
- A decomposition method for convex minimization problems and its application.
- Convergence of the augmented decomposition algorithm
- Decomposition algorithm for convex differentiable minimization
- A projective splitting algorithm for solving generalized mixed variational inequalities
- Analysis of the inexact Uzawa algorithms for nonlinear saddle-point problems
- Proximal Gradient Methods for Machine Learning and Imaging
- The forward-backward algorithm and the normal problem
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- Progressive regularization of variational inequalities and decomposition algorithms
- Strong Convergence of an Inexact Proximal Point Algorithm for Equilibrium Problems in Banach Spaces
- Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators
- The Glowinski-Le Tallec splitting method revisited: a general convergence and convergence rate analysis
This page was built for publication: Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3977035)
