Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities

DOI10.1137/0329006zbMath0737.90048OpenAlexW1970986119MaRDI QIDQ3977035

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

zbMATH Keywords

maximal monotone operatorscontinuous linear operatorsaugmented Lagrangianreal Hilbert spacesalternating minimization

Mathematics Subject Classification ID

Convex programming (90C25) Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Programming in abstract spaces (90C48) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Exploiting low-rank structure in semidefinite programming by approximate operator splitting, Proximal Splitting Methods in Signal Processing, Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings, Primal-dual algorithms for total variation based image restoration under Poisson noise, On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming, A SPLITTING METHOD FOR COMPOSITE MAPPINGS, Testable uniqueness conditions for empirical assessment of undersampling levels in total variation-regularized X-ray CT, Decomposition Methods for Sparse Matrix Nearness Problems, Global Convergence of Splitting Methods for Nonconvex Composite Optimization, Structured Sparsity: Discrete and Convex Approaches, Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework, Parallel Normal S-Iteration Methods with Applications to Optimization Problems, A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging, Extended auxiliary problem principle to variational inequalities involving multi-valued operators, A Dynamical Splitting Method for Minimizing the Sum of Three Convex Functions, Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators, Stable and robust LQR design via scenario approach, Two Steps at a Time---Taking GAN Training in Stride with Tseng's Method, Fast augmented Lagrangian method in the convex regime with convergence guarantees for the iterates, Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists, Projective method of multipliers for linearly constrained convex minimization, Sparsity promoting decentralized learning strategies for radio tomographic imaging using consensus based ADMM approach, A Weibull gradient prior for image restoration, An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function, Inducing sparsity via the horseshoe prior in imaging problems, Dual gradient method for ill-posed problems using multiple repeated measurement data, First-order methods for convex optimization, A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization, Fisher markets with linear constraints: equilibrium properties and efficient distributed algorithms, A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems, On mathematical modeling in image reconstruction and beyond, A hybrid alternating minimization algorithm for structured convex optimization problems with application in Poissonian image processing, A survey on operator splitting and decomposition of convex programs, Multiplicative Noise Removal Using L1 Fidelity on Frame Coefficients, A class of Dantzig-Wolfe type decomposition methods for variational inequality problems, Operator Splitting Performance Estimation: Tight Contraction Factors and Optimal Parameter Selection, Unnamed Item, Inertial approximation method for split variational inclusion problem in Banach spaces, A new alternating projection-based prediction–correction method for structured variational inequalities, 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, Linearized Alternating Direction Method of Multipliers for Constrained Linear Least-Squares Problem, An Extension of the Auxiliary Problem Principle to Nonsymmetric Auxiliary Operators, A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework, A decomposition method for convex minimization problems and its application., An introduction to continuous optimization for imaging, Solving monotone inclusions via compositions of nonexpansive averaged operators, A descent method for structured monotone variational inequalities, 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, 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, A stochastic inertial forward–backward splitting algorithm for multivariate monotone inclusions, Sparse Convex Clustering, On the convergence of the forward–backward splitting method with linesearches, A Dynamical Approach to Two-Block Separable Convex Optimization Problems with Linear Constraints, A partial inexact alternating direction method for structured variational inequalities, Variable metric forward–backward splitting with applications to monotone inclusions in duality, Outer Approximation Method for Constrained Composite Fixed Point Problems Involving Lipschitz Pseudo Contractive Operators, An Inexact Uzawa Algorithmic Framework for Nonlinear Saddle Point Problems with Applications to Elliptic Optimal Control Problem, Unnamed Item, Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping, Splitting-type method for systems of variational inequalities, Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions, Unnamed Item, A Variable Metric Extension of the Forward–Backward–Forward Algorithm for Monotone Operators, Dual Space Preconditioning for Gradient Descent, A proximal point method for the sum of maximal monotone operators, Random test problems and parallel methods for quadratic programs and quadratic stochastic programs^∗, Proximal Gradient Methods for Machine Learning and Imaging, Some recent advances in projection-type methods for variational inequalities, An alternating direction method of multipliers for elliptic equation constrained optimization problem, A proximal-based deomposition method for compositions method for convex minimization problems, An inertial based forward-backward algorithm for monotone inclusion problems and split mixed equilibrium problems in Hilbert spaces, Continuous dynamics related to monotone inclusions and non-smooth optimization problems, Bounding duality gap for separable problems with linear constraints, An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems, Stability and experimental comparison of prototypical iterative schemes for total variation regularized problems, A projective splitting algorithm for solving generalized mixed variational inequalities, Approximations in proximal bundle methods and decomposition of convex programs, Alternating direction method for generalized Sylvester matrix equation \(AXB + CYD = E\), Newton's method for quadratic stochastic programs with recourse, Monotone operator theory in convex optimization, Convergence rates of a dual gradient method for constrained linear ill-posed problems, An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems, A parallel descent algorithm for convex programming, Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM, An inertially constructed forward-backward splitting algorithm in Hilbert spaces, Solvability theory and projection methods for a class of singular variational inequalities: Elastostatic unilateral contact applications, A fast dual proximal gradient algorithm for convex minimization and applications, Family of perturbation methods for variational inequalities, 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, The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem, Fifty years of maximal monotonicity, Minimization of equilibrium problems, variational inequality problems and fixed point problems, Vector network equilibrium problems with elastic demands, Fast alternating linearization methods for minimizing the sum of two convex functions, New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems, An inertial forward-backward algorithm for monotone inclusions, A note on the alternating direction method of multipliers, Operator splittings, Bregman methods and frame shrinkage in image processing, The multiproximal linearization method for convex composite problems, Generalized risk parity portfolio optimization: an ADMM approach, Linearized proximal alternating minimization algorithm for motion deblurring by nonlocal regularization, Verification methods for nonlinear equations with saddle point functions, Iterative regularization via dual diagonal descent, New decomposition methods for solving variational inequality problems., A splitting algorithm for dual monotone inclusions involving cocoercive operators, An asymmetric proximal decomposition method for convex programming with linearly coupling constraints, Forward-backward splitting methods for accretive operators in Banach spaces, Algorithmic approach to a minimization problem, Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators, A self-adaptive descent LQP alternating direction method for the structured variational inequalities, Decomposition method for a class of monotone variational inequality problems, Decomposition algorithm for convex differentiable minimization, Proximal alternating penalty algorithms for nonsmooth constrained convex optimization, Convergence of the augmented decomposition algorithm, Visco-penalization of the sum of two monotone operators, An improved proximal-based decomposition method for structured monotone variational inequalities, Forward-partial inverse-forward splitting for solving monotone inclusions, The nonlinear inexact Uzawa hybrid algorithms based on one-step Newton method for solving nonlinear saddle-point problems, The Glowinski-Le Tallec splitting method revisited: a general convergence and convergence rate analysis, On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers, A three-operator splitting scheme and its optimization applications, Stability and performance verification of optimization-based controllers, On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators, The forward-backward algorithm and the normal problem, A projected subgradient method for solving generalized mixed variational inequalities, Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization, Application of the alternating direction method of multipliers to separable convex programming problems, Proximity for sums of composite functions, An improved proximal alternating direction method for monotone variational inequalities with separable structure, 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, An algorithm for finding common solutions of various problems in nonlinear operator theory, Solving policy design problems: alternating direction method of multipliers-based methods for structured inverse variational inequalities, Proximal algorithms and temporal difference methods for solving fixed point problems, A simple algorithm for a class of nonsmooth convex-concave saddle-point problems, Split Bregman iteration algorithm for total bounded variation regularization based image deblurring, Modified Fejér sequences and applications, Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods, An enhanced Baillon-Haddad theorem for convex functions defined on convex sets, Sparse illumination learning and transfer for single-sample face recognition with image corruption and misalignment, Solving composite fixed point problems with block updates, A Penalized Likelihood Method for Classification With Matrix-Valued Predictors, Convex Hodge decomposition and regularization of image flows, Local convergence analysis of projection-type algorithms: unified approach, 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, Convergence of a splitting inertial proximal method for monotone operators, On Rockafellar's theorem using proximal point algorithm involving \(H\)-maximal monotonicity framework, 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, 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, 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, On preconditioned Uzawa methods and SOR methods for saddle-point problems, 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, An adaptive alternating direction method of multipliers, 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, Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities, Nonlinear proximal decomposition method for convex programming, Converting ADMM to a proximal gradient for efficient sparse estimation, Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm, An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems