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)
- 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
- An adaptive alternating direction method of multipliers
- Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods
- A parallel descent algorithm for convex programming
- Decomposition Methods for Sparse Matrix Nearness Problems
- Alternating direction method for generalized Sylvester matrix equation \(AXB + CYD = E\)
- The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints
- Convergence of a relaxed inertial forward-backward algorithm for structured monotone inclusions
- Family of perturbation methods for variational inequalities
- On an iterative method for finding a zero to the sum of two maximal monotone operators
- A SPLITTING METHOD FOR COMPOSITE MAPPINGS
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting
- A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging
- On the splitting methods and the proximal point algorithm for maximal monotone operators
- A survey on operator splitting and decomposition of convex programs
- On Rockafellar's theorem using proximal point algorithm involving \(H\)-maximal monotonicity framework
- A proximal point method for the sum of maximal monotone operators
- Convergence rates of a dual gradient method for constrained linear ill-posed problems
- Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework
- Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions
- A fast dual proximal gradient algorithm for convex minimization and applications
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- A new alternating projection-based prediction–correction method for structured variational inequalities
- A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization
- Sparse illumination learning and transfer for single-sample face recognition with image corruption and misalignment
- Modified Fejér sequences and applications
- Primal-dual algorithms for total variation based image restoration under Poisson noise
- Projective method of multipliers for linearly constrained convex minimization
- On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers
- The multiproximal linearization method for convex composite problems
- Iterative regularization via dual diagonal descent
- Sparse Convex Clustering
- An improved proximal-based decomposition method for structured monotone variational inequalities
- Operator Splitting Performance Estimation: Tight Contraction Factors and Optimal Parameter Selection
- The nonlinear inexact Uzawa hybrid algorithms based on one-step Newton method for solving nonlinear saddle-point problems
- An Extension of the Auxiliary Problem Principle to Nonsymmetric Auxiliary Operators
- Monotone operator theory in convex optimization
- Stability and performance verification of optimization-based controllers
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
- Solvability theory and projection methods for a class of singular variational inequalities: Elastostatic unilateral contact applications
- Proximal algorithms and temporal difference methods for solving fixed point problems
- 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
- Variable metric forward–backward splitting with applications to monotone inclusions in duality
- 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
- Linearized Alternating Direction Method of Multipliers for Constrained Linear Least-Squares Problem
- 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
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)
