Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
From MaRDI portal
Publication:1594875
DOI10.1023/A:1004603514434zbMATH Open0997.49008OpenAlexW1562101002MaRDI QIDQ1594875FDOQ1594875
Bingsheng He, S. L. Wang, Hai Yang
Publication date: 11 November 2002
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1004603514434
Recommendations
- A new self-adaptive alternating direction method for variational inequality problems with linear equality and inequality constraints
- scientific article; zbMATH DE number 2076856
- A simple self-adaptive alternating direction method for linear variational inequality problems
- An inexact alternating direction method for solving a class of monotone variational inequalities
- Self-adaptive operator splitting methods for monotone variational inequalities
Approximation methods and heuristics in mathematical programming (90C59) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Variational inequalities (49J40)
Cites Work
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Application of the alternating direction method of multipliers to separable convex programming problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A variable-penalty alternating directions method for convex optimization
- Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
- Transportation Network Policy Modeling with Goal Targets and Generalized Penalty Functions
Cited In (only showing first 100 items - show all)
- A novel approach for solving semidefinite programs
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- A computation study on an integrated alternating direction method of multipliers for large scale optimization
- Total generalized variation restoration with non-quadratic fidelity
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Decomposition method with a variable parameter for a class of monotone variational inequality problems
- Alternating direction augmented Lagrangian methods for semidefinite programming
- The auxiliary problem principle with self-adaptive penalty parameter for multi-area economic dispatch problem
- A new parallel splitting descent method for structured variational inequalities
- An Alternating Augmented Lagrangian method for constrained nonconvex optimization
- Block Coordinate Descent Methods for Semidefinite Programming
- Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization
- Robust linear optimization under matrix completion
- Fast algorithms for sparse inverse covariance estimation
- New descent LQP alternating direction methods for solving a class of structured variational inequalities
- A hybrid splitting method for variational inequality problems with separable structure
- TGV-based multiplicative noise removal approach: models and algorithms
- New parallel descent-like method for solving a class of variational inequalities
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
- Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers
- A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints
- Linearized Alternating Direction Method of Multipliers for Constrained Linear Least-Squares Problem
- An ADMM numerical approach to linear parabolic state constrained optimal control problems
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- Self-adaptive operator splitting methods for monotone variational inequalities
- Optimally linearizing the alternating direction method of multipliers for convex programming
- A class of alternating linearization algorithms for nonsmooth convex optimization
- A new implementable prediction-correction method for monotone variational inequalities with separable structure
- ADMM for monotone operators: convergence analysis and rates
- Parameter Selection and Preconditioning for a Graph Form Solver
- Numerical methods for parameter estimation in Poisson data inversion
- Convergence analysis of a modified inexact implicit method for general mixed monotone variational inequalities
- Modeling and simulation of a frictional translational joint with a flexible slider and clearance
- Strong convergence of a self-adaptive method for the split feasibility problem
- An LQP-SQP alternating direction method for solving variational inequality problems with separable structure
- High dimensional covariance matrix estimation using multi-factor models from incomplete information
- A survey on operator splitting and decomposition of convex programs
- A new alternating direction method for linearly constrained nonconvex optimization problems
- Customized alternating direction methods of multipliers for generalized multi-facility Weber problem
- An improved robust ADMM algorithm for quantum state tomography
- An alternating direction method for second-order conic programming
- OSQP: An Operator Splitting Solver for Quadratic Programs
- An ADMM-based interior-point method for large-scale linear programming
- A proximal alternating linearization method for nonconvex optimization problems
- An alternating direction method for total variation denoising
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- An improved contraction method for structured monotone variational inequalities
- A descent method for structured monotone variational inequalities
- An alternating direction method for Nash equilibrium of two-person games with alternating offers
- Title not available (Why is that?)
- Parallel alternating direction method of multipliers
- An alternating direction method with increasing penalty for stable principal component pursuit
- An alternating direction and projection algorithm for structure-enforced matrix factorization
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Prediction-correction alternating direction method for a class of constrained min-max problems
- A simple and feasible method for a class of large-scale \(l^1\)-problems
- On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers
- A First-Order Primal-Dual Algorithm with Linesearch
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- Robust dequantized compressive sensing
- Inexact implicit method with variable parameter for mixed monotone variational inequalities
- An improved proximal-based decomposition method for structured monotone variational inequalities
- A new algorithm for positive semidefinite matrix completion
- Nuclear norm system identification with missing inputs and outputs
- Comparison of several fast algorithms for projection onto an ellipsoid
- Nonnegative tensor factorizations using an alternating direction method
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- An Accelerated Linearized Alternating Direction Method of Multipliers
- A line-search-based partial proximal alternating directions method for separable convex optimization
- Fast optimization methods for high-dimensional row-sparse multivariate quantile linear regression
- A fast Fourier transform based method for computing the effective crack energy of a heterogeneous material on a combinatorially consistent grid
- On non-stationary polarization methods in FFT-based computational micromechanics
- Regularized least absolute deviation-based sparse identification of dynamical systems
- Topology optimization via sequential integer programming and canonical relaxation algorithm
- A new self-adaptive alternating direction method for variational inequality problems with linear equality and inequality constraints
- To Wait or Not to Wait: Two-Way Functional Hazards Model for Understanding Waiting in Call Centers
- Robust nonconvex sparse optimization for impact force identification
- The alternating direction method of multipliers for finding the distance between ellipsoids
- Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness
- Anderson Accelerated Douglas--Rachford Splitting
- Tensorial total variation-based image and video restoration with optimized projection methods
- On two symmetric Dai-Kou type schemes for constrained monotone equations with image recovery application
- Modification of a conjugate gradient approach for convex constrained nonlinear monotone equations with applications in signal recovery and image restoration
- Non-stationary Douglas-Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence
- Generalized risk parity portfolio optimization: an ADMM approach
- Hybrid regularized cone-beam reconstruction for axially symmetric object tomography
- Efficient iterative solution of finite element discretized nonsmooth minimization problems
- A modified Dai-Kou-type method with applications to signal reconstruction and blurred image restoration
- High-dimensional functional graphical model structure learning via neighborhood selection approach
- Hierarchical distributed optimization of constraint-coupled convex and mixed-integer programs using approximations of the dual function
- ADMM-TGV image restoration for scientific applications with unbiased parameter choice
- Title not available (Why is that?)
- Supervised distance preserving projection using alternating direction method of multipliers
- Modified Dai-Zuan iterative scheme for nonlinear systems and its application
- An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
- A proximal alternating direction method of multipliers for DC programming with structured constraints
- Title not available (Why is that?)
- Spatially varying coefficient models with sign preservation of the coefficient functions
- A survey on some recent developments of alternating direction method of multipliers
This page was built for publication: Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1594875)
