Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
From MaRDI portal
(Redirected from Publication:3977035)
alternating minimizationaugmented Lagrangiancontinuous linear operatorsmaximal monotone operatorsreal Hilbert spaces
Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Variational inequalities (49J40) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) 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)- Convex Hodge decomposition and regularization of image flows
- On Rockafellar's theorem using proximal point algorithm involving H-maximal monotonicity framework
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
- Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions
- Decomposition algorithm for convex differentiable minimization
- 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
- Progressive regularization of variational inequalities and decomposition algorithms
- Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators
- On preconditioned Uzawa methods and SOR methods for saddle-point problems
- A proximal-based deomposition method for compositions method for convex minimization problems
- Solvability theory and projection methods for a class of singular variational inequalities: Elastostatic unilateral contact applications
- Verification methods for nonlinear equations with saddle point functions
- New decomposition methods for solving variational inequality problems.
- A Penalized Likelihood Method for Classification With Matrix-Valued Predictors
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Nonlinear proximal decomposition method for convex programming
- Alternating direction method for generalized Sylvester matrix equation \(AXB + CYD = E\)
- Monotone operator theory in convex optimization
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- A fast dual proximal gradient algorithm for convex minimization and applications
- Iterative regularization via dual diagonal descent
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
- Convergence of the augmented decomposition algorithm
- The forward-backward algorithm and the normal problem
- A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
- Modified Fejér sequences and applications
- Sparse illumination learning and transfer for single-sample face recognition with image corruption and misalignment
- Local convergence analysis of projection-type algorithms: unified approach
- Convergence of a splitting inertial proximal method for monotone operators
- Some recent advances in projection-type methods for variational inequalities
- Approximations in proximal bundle methods and decomposition of convex programs
- Newton's method for quadratic stochastic programs with recourse
- A parallel descent algorithm for convex programming
- Family of perturbation methods for variational inequalities
- A parallel inexact Newton method for stochastic programs with recourse
- The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
- A note on the alternating direction method of multipliers
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Decomposition method for a class of monotone variational inequality problems
- The Glowinski-Le Tallec splitting method revisited: a general convergence and convergence rate analysis
- An algorithm for finding common solutions of various problems in nonlinear operator theory
- An enhanced Baillon-Haddad theorem for convex functions defined on convex sets
- Solving composite fixed point problems with block updates
- Random activations in primal-dual splittings for monotone inclusions with a priori information
- A total variation regularization method for inverse source problem with uniform noise
- An adaptive alternating direction method of multipliers
- Converting ADMM to a proximal gradient for efficient sparse estimation
- An inertial based forward-backward algorithm for monotone inclusion problems and split mixed equilibrium problems in Hilbert spaces
- Convergence rates of a dual gradient method for constrained linear ill-posed problems
- An inertially constructed forward-backward splitting algorithm in Hilbert spaces
- The multiproximal linearization method for convex composite problems
- Generalized risk parity portfolio optimization: an ADMM approach
- A self-adaptive descent LQP alternating direction method for the structured variational inequalities
- Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization
- Convergence analysis of the generalized alternating direction method of multipliers with logarithmic-quadratic proximal regularization
- Convergence of splitting algorithms for the sum of two accretive operators with applications
- Strong convergence of a parallel iterative algorithm in a reflexive Banach space
- Solving policy design problems: alternating direction method of multipliers-based methods for structured inverse variational inequalities
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms
- On an iterative method for finding a zero to the sum of two maximal monotone operators
- Convergence of a relaxed inertial forward-backward algorithm for structured monotone inclusions
- On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems
- A splitting algorithm for coupled system of primal-dual monotone inclusions
- An alternating direction method of multipliers for elliptic equation constrained optimization problem
- A projective splitting algorithm for solving generalized mixed variational inequalities
- Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators
- Projective method of multipliers for linearly constrained convex minimization
- A class of Dantzig-Wolfe type decomposition methods for variational inequality problems
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- Proximal alternating directions method for structured variational inequalities
- Benders decomposition for a class of variational inequalities
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
- Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
- Splitting-type method for systems of variational inequalities
- An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
- Primal-dual algorithms for total variation based image restoration under Poisson noise
- Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework
- Stable and robust LQR design via scenario approach
- A hybrid alternating minimization algorithm for structured convex optimization problems with application in Poissonian image processing
- A stochastic inertial forward–backward splitting algorithm for multivariate monotone inclusions
- On the convergence of the forward-backward splitting method with linesearches
- A Variable Metric Extension of the Forward–Backward–Forward Algorithm for Monotone Operators
- Bounding duality gap for separable problems with linear constraints
- Proximal splitting methods in signal processing
- Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
- An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems
- A survey on operator splitting and decomposition of convex programs
- Stability and experimental comparison of prototypical iterative schemes for total variation regularized problems
- Strong Convergence of an Inexact Proximal Point Algorithm for Equilibrium Problems in Banach Spaces
- Analysis of the inexact Uzawa algorithms for nonlinear saddle-point problems
- Outer Approximation Method for Constrained Composite Fixed Point Problems Involving Lipschitz Pseudo Contractive Operators
- Splitting forward-backward penalty scheme for constrained variational problems
- A proximal strictly contractive Peaceman-Rachford splitting method for convex programming with applications to imaging
- 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
- Sparse Convex Clustering
- On the splitting methods and the proximal point algorithm for maximal monotone operators
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)
