A new inexact alternating directions method for monotone variational inequalities

From MaRDI portal
Publication:1600096

DOI10.1007/s101070100280zbMath1009.90108OpenAlexW2026517977MaRDI QIDQ1600096

Li-Zhi Liao, Deren Han, Hai Yang, Bing-sheng He

Publication date: 5 November 2002

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070100280



Related Items

Fast algorithms for sparse inverse covariance estimation, A proximal alternating direction method for \(\ell_{2,1}\)-norm least squares problem in multi-task feature learning, A new accelerated positive-indefinite proximal ADMM for constrained separable convex optimization problems, Block decomposition methods for total variation by primal-dual stitching, Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization, On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming, Decomposition Methods Based on Augmented Lagrangians: A Survey, A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging, On the global and linear convergence of the generalized alternating direction method of multipliers, Unnamed Item, Alternating proximal gradient method for convex minimization, A proximal ADMM with the Broyden family for convex optimization problems, An alternating direction method for total variation denoising, An accelerated proximal augmented Lagrangian method and its application in compressive sensing, A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems, Inexact alternating direction methods of multipliers for separable convex optimization, Approximate variational inequalities and equilibria, A golden ratio proximal alternating direction method of multipliers for separable convex optimization, A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization, On descent alternating direction method with LQP regularization for the structured variational inequalities, \(O(1/t)\) complexity analysis of the generalized alternating direction method of multipliers, Linearized generalized ADMM-based algorithm for multi-block linearly constrained separable convex programming in real-world applications, A separable surrogate function method for sparse and low-rank matrices decomposition, Communication-efficient distributed estimation for high-dimensional large-scale linear regression, An extended linearized alternating direction method of multipliers for fused-Lasso penalized linear regression, Inexact generalized ADMM with relative error criteria for linearly constrained convex optimization problems, Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization, Convergence study on the proximal alternating direction method with larger step size, Alternating direction methods for solving a class of Sylvester-like matrix equations, Inexact alternating direction methods of multipliers with logarithmic-quadratic proximal regularization, A class of Dantzig-Wolfe type decomposition methods for variational inequality problems, Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints, Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection, A new alternating projection-based prediction–correction method for structured variational inequalities, A self-adaptive descent LQP alternating direction method for the structured variational inequalities, A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints, An inexact alternating direction method for solving a class of structured variational inequalities, A modified alternating projection based prediction-correction method for structured variational inequalities, An alternating direction method of multipliers with a worst-case $O(1/n^2)$ convergence rate, Efficient algorithms for solving condition number-constrained matrix minimization problems, A linearized Peaceman-Rachford splitting method for structured convex optimization with application to stable principal component pursuit, On alternating direction method for solving variational inequality problems with separable structure, Benders decomposition for a class of variational inequalities, Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems, A hybrid LQP-based method for structured variational inequalities, SQP alternating direction method with a new optimal step size for solving variational inequality problems with separable structure, Linearized Alternating Direction Method of Multipliers for Constrained Linear Least-Squares Problem, Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization, An alternating direction method for linear‐constrained matrix nuclear norm minimization, On LQP alternating direction method for solving variational inequality problems with separable structure, Convergence analysis of the generalized alternating direction method of multipliers with logarithmic-quadratic proximal regularization, Parallel LQP alternating direction method for solving variational inequality problems with separable structure, Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization, Solving semidefinite programming problems via alternating direction methods, Solving policy design problems: alternating direction method of multipliers-based methods for structured inverse variational inequalities, Alternating direction method for covariance selection models, A descent method for structured monotone variational inequalities, Implementing the Alternating Direction Method of Multipliers for Big Datasets: A Case Study of Least Absolute Shrinkage and Selection Operator, Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems, Inexact decomposition methods for solving variational inequalities with linear equality constraint, A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems, An efficient method for solving a matrix least squares problem over a matrix inequality constraint, A distributed Douglas-Rachford splitting method for multi-block convex minimization problems, A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization, Block Coordinate Descent Methods for Semidefinite Programming, An alternating direction method for solving a class of inverse semi-definite quadratic programming problems, Generalized alternating direction method of multipliers: new theoretical insights and applications, Block-wise Alternating Direction Method of Multipliers for Multiple-block Convex Programming and Beyond, Optimally linearizing the alternating direction method of multipliers for convex programming, Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming, A conjugate gradient projection method for solving equations with convex constraints, A sequential updating scheme of the Lagrange multiplier for separable convex programming, Accelerated alternating direction method of multipliers: an optimal \(O(1 / K)\) nonergodic analysis, A class of alternating linearization algorithms for nonsmooth convex optimization, A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis, A new implementable prediction-correction method for monotone variational inequalities with separable structure, A new LQP alternating direction method for solving variational inequality problems with separable structure, An alternating direction method for solving convex nonlinear semidefinite programming problems, An alternating direction-based contraction method for linearly constrained separable convex programming problems, An alternate minimization method beyond positive definite proximal regularization: convergence and complexity, Unnamed Item, An ADMM-Newton-CNN numerical approach to a TV model for identifying discontinuous diffusion coefficients in elliptic equations: convex case with gradient observations, An improved contraction method for structured monotone variational inequalities, Regularized variational dynamic stochastic resonance method for enhancement of dark and low-contrast image, A line-search-based partial proximal alternating directions method for separable convex optimization, A new criterion for an inexact parallel splitting augmented Lagrangian method, LINEARIZED ALTERNATING DIRECTION METHOD OF MULTIPLIERS FOR SEPARABLE CONVEX OPTIMIZATION OF REAL FUNCTIONS IN COMPLEX DOMAIN, On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming, A hybrid splitting method for variational inequality problems with separable structure, Application of the Alternating Direction Method of Multipliers to Control Constrained Parabolic Optimal Control Problems and Beyond, A class of nonlinear proximal point algorithms for variational inequality problems, Dual–primal proximal point algorithms for extended convex programming, Convergence study on the logarithmic-quadratic proximal regularization of strictly contractive Peaceman–Rachford splitting method with larger step-size, Convergence analysis on a modified generalized alternating direction method of multipliers, Alternating direction method of multipliers with variable metric indefinite proximal terms for convex optimization, New estimates of odd exponents of infinite Burnside groups., New descent LQP alternating direction methods for solving a class of structured variational inequalities, An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem, An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems, A descent LQP alternating direction method for solving variational inequality problems with separable structure, A survey on some recent developments of alternating direction method of multipliers, An algorithm twisted from generalized ADMM for multi-block separable convex minimization models, On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models, An inexact LQP alternating direction method for solving a class of structured variational inequalities, Alternating direction method for generalized Sylvester matrix equation \(AXB + CYD = E\), A decomposable self-adaptive projection-based prediction-correction algorithm for convex time space network flow problem, Speckle noise removal in ultrasound images by first- and second-order total variation, An alternating direction method for second-order conic programming, The developments of proximal point algorithms, An alternating direction method for Nash equilibrium of two-person games with alternating offers, On the information-adaptive variants of the ADMM: an iteration complexity perspective, Convergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factor, On the \(O(1/t)\) convergence rate of the parallel descent-like method and parallel splitting augmented Lagrangian method for solving a class of variational inequalities, Fast alternating linearization methods for minimizing the sum of two convex functions, A new parallel splitting descent method for structured variational inequalities, An improved first-order primal-dual algorithm with a new correction step, A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs, On the convergence rate of a class of proximal-based decomposition methods for monotone variational inequalities, An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems, An alternating direction and projection algorithm for structure-enforced matrix factorization, Approximate ADMM algorithms derived from Lagrangian splitting, A note on the alternating direction method of multipliers, A proximal alternating linearization method for minimizing the sum of two convex functions, Alternating direction augmented Lagrangian methods for semidefinite programming, Viscosity iterative schemes for finding split common solutions of variational inequalities and fixed point problems, An augmented Lagrangian-based parallel splitting method for a one-leader-two-follower game, Optimal matrix pencil approximation problem in structural dynamic model updating, Nonnegative tensor factorizations using an alternating direction method, Fast minimization methods for solving constrained total-variation superresolution image reconstruction, Linearized proximal alternating minimization algorithm for motion deblurring by nonlocal regularization, Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing, An ADM-based splitting method for separable convex programming, Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods, Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments, Alternating direction method for structure-persevering finite element model updating problem, A proximal decomposition algorithm for variational inequality problems., A homotopy alternating direction method of multipliers for linearly constrained separable convex optimization, Prediction-correction alternating direction method for a class of constrained min-max problems, An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures, Robust least square semidefinite programming with applications, Alternating direction method of multipliers for sparse principal component analysis, Least absolute deviations learning of multiple tasks, An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints, A simple alternating direction method for the conic trust region subproblem, Alternating direction method for bi-quadratic programming, Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization, Modified alternating direction methods for the modified multiple-sets split feasibility problems, Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem, A class of linearized proximal alternating direction methods, A phase model for point spread function estimation in ground-based astronomy, An ADMM algorithm for second-order TV-based MR image reconstruction, On Glowinski's open question on the alternating direction method of multipliers, An inexact alternating direction method for structured variational inequalities, A new descent alternating direction method with LQP regularization for the structured variational inequalities, Convergence of the augmented decomposition algorithm, An improved proximal-based decomposition method for structured monotone variational inequalities, A relaxed projection method for split variational inequalities, An alternating direction method with increasing penalty for stable principal component pursuit, A new alternating direction method for linearly constrained nonconvex optimization problems, A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints, An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization, The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization, On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers, An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming, A generalized matrix Krylov subspace method for TV regularization, Comparison of several fast algorithms for projection onto an ellipsoid, An extragradient-based alternating direction method for convex minimization, TGV-based multiplicative noise removal approach: models and algorithms, Iteration complexity analysis of block coordinate descent methods, On inexact ADMMs with relative error criteria, A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming, Efficient alternating minimization methods for variational edge-weighted colorization models, An efficient simultaneous method for the constrained multiple-sets split feasibility problem, The hybrid proximal decomposition method applied to the computation of a Nash equilibrium for hydrothermal electricity markets, An improved proximal alternating direction method for monotone variational inequalities with separable structure, A simple and feasible method for a class of large-scale \(l^1\)-problems, Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis, On the convergence analysis of the alternating direction method of multipliers with three blocks, An improved prediction-correction method for monotone variational inequalities with separable operators, A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming, Convergence rates for an inexact ADMM applied to separable convex optimization, New parallel descent-like method for solving a class of variational inequalities, A globally convergent non-interior point algorithm with full Newton step for second-order cone programming, Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers, Variable splitting based method for image restoration with impulse plus Gaussian noise, Dantzig-Wolfe decomposition of variational inequalities, A prediction-correction inexact alternating direction method for convex nonlinear second-order cone programming with linear constraints, A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems, Convergence study of indefinite proximal ADMM with a relaxation factor, Non-convex fractional-order TV model for impulse noise removal, An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems, The improvement with relative errors of He et al.'s inexact alternating direction method for monotone variational inequalities, Convergence analysis of L-ADMM for multi-block linear-constrained separable convex minimization problem