A modified alternating direction method for convex minimization problems

DOI10.1016/S0893-9659(99)00175-5zbMath0988.90020OpenAlexW2038571558MaRDI QIDQ1975294

Jing Zhou, Bing-sheng He

Publication date: 22 July 2002

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(99)00175-5

zbMATH Keywords

augmented Lagrangian methodalternative direction

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06)

Related Items (19)

New descent LQP alternating direction methods for solving a class of structured variational inequalities ⋮ An inexact LQP alternating direction method for solving a class of structured variational inequalities ⋮ An extended alternating direction method for variational inequality problems with linear equality and inequality constraints ⋮ A new decomposition method for variational inequalities with linear constraints ⋮ Two new self-adaptive descent methods without line search for co-coercive structured variational inequality problems ⋮ A dynamic system model for solving convex nonlinear optimization problems ⋮ New decomposition methods for solving variational inequality problems. ⋮ A proximal decomposition algorithm for variational inequality problems. ⋮ A new alternating direction method for solving variational inequalities ⋮ Consensus proximal support vector machine for classification problems with sparse solutions ⋮ A new alternating direction method for co-coercive variational inequality problems ⋮ An LQP-SQP alternating direction method for solving variational inequality problems with separable structure ⋮ Solving semidefinite programming problems via alternating direction methods ⋮ An alternating direction method for general variational inequalities ⋮ A simple self-adaptive alternating direction method for linear variational inequality problems ⋮ A line-search-based partial proximal alternating directions method for separable convex optimization ⋮ A neural network for monotone variational inequalities with linear constraints ⋮ New alternating direction method for a class of nonlinear variational inequality problems ⋮ A new stepsize rule in He and Zhou's alternating direction method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Solving a class of linear projection equations
• A new method for a class of linear variational inequalities
• Network economics: a variational inequality approach
• A class of projection and contraction methods for monotone variational inequalities
• Bimatrix Equilibrium Points and Mathematical Programming
• On the basic theorem of complementarity

This page was built for publication: A modified alternating direction method for convex minimization problems