Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
From MaRDI portal
Publication:2277367
DOI10.1007/BF01582258zbMATH Open0725.90079OpenAlexW2126051190MaRDI QIDQ2277367FDOQ2277367
Publication date: 1990
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582258
Recommendations
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- An application of splitting methods to convex partially separable optimization problems
- scientific article; zbMATH DE number 7709327
- Algorithms for the split variational inequality problem
- A splitting method for separable convex programming
- The split variational inequality problem and its algorithm iteration
- A split variational inequality problem and its convergence algorithm
- Splitting algorithms for general pseudomonotone mixed variational inequalities
- An algorithm for approximating solutions of variational inequality and split fixed point problems with applications
- An algorithmic approach to the split variational inequality and fixed point problem
matrix splitting algorithmlinear complementarityconvergence conditionmonotone affine variational inequalityasymmetric projection
Numerical mathematical programming methods (65K05) 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) Variational inequalities (49J40) Decomposition methods (49M27) Linear-quadratic optimal control problems (49N10) Distributed algorithms (68W15)
Cites Work
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Convex Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Monotone (nonlinear) operators in Hilbert space
- Title not available (Why is that?)
- Title not available (Why is that?)
- Monotone Operators and the Proximal Point Algorithm
- Convex programming in Hilbert space
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- A Parallel Algorithm for a Class of Convex Programs
- An iterative scheme for variational inequalities
- On the Maximality of Sums of Nonlinear Monotone Operators
- Solution of symmetric linear complementarity problems by iterative methods
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
- Methodes itératives pour les équations et inéquations aux dérivées partielles non linéaires de type monotone. (Iteration methods for nonlinear equations and inequations with partial derivatives of monotone type)
- Iterative methods for variational and complementarity problems
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- On the monotonicity of the gradient of a convex function
- A successive projection method
- Asymmetric variational inequality problems over product sets: Applications and iterative methods
- Title not available (Why is that?)
- On Convergence of the PIES Algorithm for Computing Equilibria
- An iterative solution of a variational inequality for certain monotone operators in Hilbert space
- Linear-Quadratic Programming and Optimal Control
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- Title not available (Why is that?)
- Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization
Cited In (74)
- Outer Approximation Method for Constrained Composite Fixed Point Problems Involving Lipschitz Pseudo Contractive Operators
- Existence of solutions for generalized nonlinear mixed variational-like inequalities in Banach spaces
- Benders decomposition for a class of variational inequalities
- Splitting methods for pseudomonotone mixed variational inequalities
- Approximations in proximal bundle methods and decomposition of convex programs
- On the convergence of the forward–backward splitting method with linesearches
- A class of combined iterative methods for solving variational inequalities
- The strong convergence of prediction-correction and relaxed hybrid steepest-descent method for variational inequalities
- Variable metric forward–backward splitting with applications to monotone inclusions in duality
- Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
- Solution point characterizations and convergence analysis of a descent algorithm for nonsmooth continuous complementarity problems.
- Iterative methods for solving variational inequalities of the theory of soft shells
- Application of the alternating direction method of multipliers to separable convex programming problems
- Existence and algorithm of solutions for mixed quasi-variational-like inclusions in Banach spaces
- Mathematical programming for the sum of two convex functions with applications to lasso problem, split feasibility problems, and image deblurring problem
- Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
- Generalized \(H(\cdot, \cdot, \cdot)\)-\(\eta\)-cocoercive operators and generalized set-valued variational-like inclusions
- Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators
- Long-step primal path-following algorithm for monotone variational inequality problems
- Forward-partial inverse-forward splitting for solving monotone inclusions
- Existence of solutions and an algorithm for mixed variational-like inequalities in Banach spaces
- Decomposition Methods for Sparse Matrix Nearness Problems
- Existence and algorithm of solutions for nonlinear mixed variational-like inequalities in Banach spaces.
- Convergence of a splitting inertial proximal method for monotone operators
- Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
- The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Family of perturbation methods for variational inequalities
- On an iterative method for finding a zero to the sum of two maximal monotone operators
- A class of alternating linearization algorithms for nonsmooth convex optimization
- Algorithm for solving a new system of generalized variational inclusions in Hilbert spaces
- Algorithm for solving a new system of generalized nonlinear quasi-variational-like inclusions in Hilbert spaces
- On the convergence of projection methods: Application to the decomposition of affine variational inequalities
- A splitting algorithm for coupled system of primal-dual monotone inclusions
- New classes of generalized monotonicity
- Some Goldstein's type methods for co-coercive variant variational inequalities
- Augmented Lagrangian theory, duality and decomposition methods for variational inequality problems
- A stochastic inertial forward–backward splitting algorithm for multivariate monotone inclusions
- Local convergence analysis of projection-type algorithms: unified approach
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
- Global bounds for the distance to solutions of co-coercive variational inequalities
- Global bounds for cocoercive variational inequalities
- General iterative algorithms for solving mixed quasi-variational-like inclusions
- A proximal alternating linearization method for nonconvex optimization problems
- Solving variational inequality and fixed point problems by line searches and potential optimization
- 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
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Existence and algorithm of solutions for generalized strongly nonlinear mixed variational-like inequalities in Banach spaces
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- Monotone mixed variational inequalities
- A proximal alternating linearization method for minimizing the sum of two convex functions
- Coupling the auxiliary problem principle and epiconvergence theory to solve general variational inequalities
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- \(H(\cdot ,\cdot)\)-cocoercive operator and an application for solving generalized variational inclusions
- Fast alternating linearization methods for minimizing the sum of two convex functions
- A unifying geometric solution framework and complexity analysis for variational inequalities
- A subgradient-type method for the equilibrium problem over the fixed point set and its applications
- Generalized Monotone Mappings with Applications
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Generalized set-valued variational-like inclusions involving \(H(\cdot, \cdot)\)-\(\eta\)-cocoercive operator in Banach spaces
- Inverse variational inequalities with projection-based solution methods
- Some recent advances in projection-type methods for variational inequalities
- Iterative schemes for solving mixed variational-like inequalities
- On the convergence of the dual-type iterative method for mixed variational inequalities
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
- Weak co-coercivity and its applications in several algorithms for solving variational inequalities
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
- \(H((\cdot, \cdot),(\cdot, \cdot))\)-mixed cocoercive operators with an application for solving variational inclusions in Hilbert spaces
- Study on the Splitting Methods for Separable Convex Optimization in a Unified Algorithmic Framework
- The geometry of monotone operator splitting methods
- Iterative algorithm for solving mixed quasi-variational-like inequalities with skew-symmetric terms in Banach spaces
- Extended auxiliary problem principle to variational inequalities involving multi-valued operators
- Some improved convergence results for variational inequality problems
- Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates
This page was built for publication: Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277367)
