A variable-penalty alternating directions method for convex optimization

DOI10.1007/BF02680549zbMath0920.90118OpenAlexW1983357136MaRDI QIDQ1290650

Spyridon Kontogiorgis, Robert R. Meyer

Publication date: 3 June 1999

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

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

zbMATH Keywords

convergencedecompositionparallel computingalternating directionssum of two convex functionsblock angular optimization

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

New descent LQP alternating direction methods for solving a class of structured variational inequalities, 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, Approximation Schemes for Materials with Discontinuities, On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming, An inexact LQP alternating direction method for solving a class of structured variational inequalities, Decomposition Methods Based on Augmented Lagrangians: A Survey, An alternating direction method for second-order conic programming, The developments of proximal point algorithms, On the \(O(1/t)\) convergence rate of the alternating direction method with LQP regularization for solving structured variational inequality problems, Stable analysis of compressive principal component pursuit, 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, Principal component analysis based on nuclear norm minimization, Variable metric primal-dual method for convex optimization problems with changing constraints, A note on the alternating direction method of multipliers, Alternating direction augmented Lagrangian methods for semidefinite programming, Efficient iterative solution of finite element discretized nonsmooth minimization problems, An augmented Lagrangian-based parallel splitting method for a one-leader-two-follower game, A new decomposition method for variational inequalities with linear constraints, A separable surrogate function method for sparse and low-rank matrices decomposition, On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems, Optimal matrix pencil approximation problem in structural dynamic model updating, Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization, An ADM-based splitting method for separable convex programming, Alternating direction method for structure-persevering finite element model updating problem, A survey on operator splitting and decomposition of convex programs, Prediction-correction alternating direction method for a class of constrained min-max problems, 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, 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 class of linearized proximal alternating direction methods, Proximal alternating directions method for structured variational inequalities, A new descent alternating direction method with LQP regularization for the structured variational inequalities, An improved proximal-based decomposition method for structured monotone variational inequalities, An alternating direction method with increasing penalty for stable principal component pursuit, On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers, SQP alternating direction method with a new optimal step size for solving variational inequality problems with separable structure, A computation study on an integrated alternating direction method of multipliers for large scale optimization, On the linear convergence of the alternating direction method of multipliers, Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization, High-order total variation regularization approach for axially symmetric object tomography from a single radiograph, An efficient simultaneous method for the constrained multiple-sets split feasibility problem, 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, Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis, An LQP-SQP alternating direction method for solving variational inequality problems with separable structure, Parallel LQP alternating direction method for solving variational inequality problems with separable structure, An improved prediction-correction method for monotone variational inequalities with separable operators, Decomposition method with a variable parameter for a class of monotone variational inequality problems, New parallel descent-like method for solving a class of variational inequalities, Alternating direction method for covariance selection models, Block Coordinate Descent Methods for Semidefinite Programming, Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach, An LQP-based symmetric alternating direction method of multipliers with larger step sizes, An alternating direction method for mixed Gaussian plus impulse noise removal, Unnamed Item, Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities, The improvement with relative errors of He et al.'s inexact alternating direction method for monotone variational inequalities

Cites Work

• Partial inverse of a monotone operator
• On the convergence of the exponential multiplier method for convex programming
• On the gradient-projection method for solving the nonsymmetric linear complementarity problem
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A diagonal quadratic approximation method for large scale linear programs
• Application of the alternating direction method of multipliers to separable convex programming problems
• Multiplier methods: A survey
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Lectures on optimization - theory and algorithms. Notes by M. K. V. Murthy
• A proximal-based deomposition method for compositions method for convex minimization problems
• The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
• The Fermat-Weber location problem revisited
• Multiplier and gradient methods
• The multiplier method of Hestenes and Powell applied to convex programming
• Alternating direction splittings for block angular parallel optimization
• Multipoint methods for separable nonlinear networks
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• Applications of the method of partial inverses to convex programming: Decomposition
• A Parallel Algorithm for a Class of Convex Programs
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Secant approximation methods for convex optimization
• Solving multistage stochastic networks: An application of scenario aggregation
• Multicommodity network flows—A survey
• On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Test of probabilistic models for the propagation of roundoff errors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item