Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
From MaRDI portal
Publication:3977035
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)
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
Cited in
(only showing first 100 items - show all)- A Penalized Likelihood Method for Classification With Matrix-Valued Predictors
- A partial inexact alternating direction method for structured variational inequalities
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Verification methods for nonlinear equations with saddle point functions
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
- A splitting algorithm for coupled system of primal-dual monotone inclusions
- Convergence of a splitting inertial proximal method for monotone operators
- Testable uniqueness conditions for empirical assessment of undersampling levels in total variation-regularized X-ray CT
- On preconditioned Uzawa methods and SOR methods for saddle-point problems
- Operator splittings, Bregman methods and frame shrinkage in image processing
- A note on the alternating direction method of multipliers
- A descent method for structured monotone variational inequalities
- Application of the alternating direction method of multipliers to separable convex programming problems
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- Outer Approximation Method for Constrained Composite Fixed Point Problems Involving Lipschitz Pseudo Contractive Operators
- Multiplicative noise removal using L1 fidelity on frame coefficients
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A projected subgradient method for solving generalized mixed variational inequalities
- Bounding duality gap for separable problems with linear constraints
- Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
- Linearized proximal alternating minimization algorithm for motion deblurring by nonlocal regularization
- On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming
- Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
- 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
- A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
- Local convergence analysis of projection-type algorithms: unified approach
- A three-operator splitting scheme and its optimization applications
- Linearized alternating direction method for constrained linear least-squares problem.
- Minimization of equilibrium problems, variational inequality problems and fixed point problems
- Random test problems and parallel methods for quadratic programs and quadratic stochastic programs∗
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
- An introduction to continuous optimization for imaging
- On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems
- Proximal splitting methods in signal processing
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Split Bregman iteration algorithm for total bounded variation regularization based image deblurring
- Convergence analysis of the generalized alternating direction method of multipliers with logarithmic-quadratic proximal regularization
- Decomposition method for a class of monotone variational inequality problems
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- Nonlinear proximal decomposition method for convex programming
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
- Approximations in proximal bundle methods and decomposition of convex programs
- Stability and experimental comparison of prototypical iterative schemes for total variation regularized problems
- An improved proximal alternating direction method for monotone variational inequalities with separable structure
- Variable metric forward-backward splitting with applications to monotone inclusions in duality
- Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators
- A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
- Newton's method for quadratic stochastic programs with recourse
- A family of operator splitting methods revisited
- Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- First-order methods for convex optimization
- Fifty years of maximal monotonicity
- Forward-partial inverse-forward splitting for solving monotone inclusions
- A class of Dantzig-Wolfe type decomposition methods for variational inequality problems
- Proximity for sums of composite functions
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping
- A parallel inexact Newton method for stochastic programs with recourse
- Convergence of splitting algorithms for the sum of two accretive operators with applications
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
- Convex Hodge decomposition and regularization of image flows
- Visco-penalization of the sum of two monotone operators
- An inertial forward-backward algorithm for monotone inclusions
- Splitting-type method for systems of variational inequalities
- Proximal alternating directions method for structured variational inequalities
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- An asymmetric proximal decomposition method for convex programming with linearly coupling constraints
- An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
- Algorithmic approach to a minimization problem
- A Variable Metric Extension of the Forward–Backward–Forward Algorithm for Monotone Operators
- The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
- Inducing sparsity via the horseshoe prior in imaging problems
- A stochastic inertial forward–backward splitting algorithm for multivariate monotone inclusions
- An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems
- Vector network equilibrium problems with elastic demands
- Benders decomposition for a class of variational inequalities
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- A proximal-based deomposition method for compositions method for convex minimization problems
- New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems
- 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
- Some recent advances in projection-type methods for variational inequalities
- New decomposition methods for solving variational inequality problems.
- Primal-dual algorithms for total variation based image restoration under Poisson noise
- An adaptive alternating direction method of multipliers
- Sparse Convex Clustering
- Decomposition methods for sparse matrix nearness problems
- Decomposition algorithm for convex differentiable minimization
- On the splitting methods and the proximal point algorithm for maximal monotone operators
- Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework
- Modified Fejér sequences and applications
- Global convergence of splitting methods for nonconvex composite optimization
- A proximal point method for the sum of maximal monotone operators
- Convergence of the augmented decomposition algorithm
- Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
- Proximal algorithms and temporal difference methods for solving fixed point problems
- Continuous dynamics related to monotone inclusions and non-smooth optimization problems
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)
