A variable-penalty alternating directions method for convex optimization
From MaRDI portal
Publication:1290650
DOI10.1007/BF02680549zbMATH Open0920.90118OpenAlexW1983357136MaRDI QIDQ1290650FDOQ1290650
Authors: 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
Recommendations
- Parallel alternating direction multiplier decomposition of convex programs
- A modified alternating direction method for convex minimization problems
- Application of the alternating direction method of multipliers to separable convex programming problems
- scientific article; zbMATH DE number 2076856
- Generalized alternating direction method of multipliers: new theoretical insights and applications
convergencedecompositionparallel computingalternating directionssum of two convex functionsblock angular optimization
Cites Work
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Title not available (Why is that?)
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- Title not available (Why is that?)
- Multiplier and gradient methods
- Title not available (Why is that?)
- Application of the alternating direction method of multipliers to separable convex programming problems
- A proximal-based deomposition method for compositions method for convex minimization problems
- The multiplier method of Hestenes and Powell applied to convex programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Title not available (Why is that?)
- On the convergence of the exponential multiplier method for convex programming
- A Parallel Algorithm for a Class of Convex Programs
- Title not available (Why is that?)
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Partial inverse of a monotone operator
- Solving multistage stochastic networks: An application of scenario aggregation
- Multiplier methods: A survey
- Applications of the method of partial inverses to convex programming: Decomposition
- Multicommodity network flows—A survey
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- The Fermat-Weber location problem revisited
- Lectures on optimization - theory and algorithms. Notes by M. K. V. Murthy
- Title not available (Why is that?)
- A diagonal quadratic approximation method for large scale linear programs
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
- On the gradient-projection method for solving the nonsymmetric linear complementarity problem
- Secant approximation methods for convex optimization
- Alternating direction splittings for block angular parallel optimization
- Multipoint methods for separable nonlinear networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Test of probabilistic models for the propagation of roundoff errors
Cited In (63)
- 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
- Variable metric primal-dual method for convex optimization problems with changing constraints
- On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming
- A computation study on an integrated alternating direction method of multipliers for large scale optimization
- Parallel LQP alternating direction method for solving variational inequality problems with separable structure
- Inexact penalty decomposition methods for optimization problems with geometric constraints
- Decomposition method with a variable parameter for a class of monotone variational inequality problems
- An alternating direction method for mixed Gaussian plus impulse noise removal
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Approximation Schemes for Materials with Discontinuities
- A new decomposition method for variational inequalities with linear constraints
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- Block Coordinate Descent Methods for Semidefinite Programming
- An ADM-based splitting method for separable convex programming
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis
- 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
- An inexact LQP alternating direction method for solving a class of structured variational inequalities
- New parallel descent-like method for solving a class of variational inequalities
- Title not available (Why is that?)
- Alternating direction method for structure-persevering finite element model updating problem
- An efficient simultaneous method for the constrained multiple-sets split feasibility problem
- Alternating direction method for covariance selection models
- An LQP-based symmetric alternating direction method of multipliers with larger step sizes
- An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
- On the linear convergence of the alternating direction method of multipliers
- Efficient iterative solution of finite element discretized nonsmooth minimization problems
- An LQP-SQP alternating direction method for solving variational inequality problems with separable structure
- Alternating conditional gradient method for convex feasibility problems
- A class of linearized proximal alternating direction methods
- An improved prediction-correction method for monotone variational inequalities with separable operators
- A survey on operator splitting and decomposition of convex programs
- An augmented Lagrangian-based parallel splitting method for a one-leader-two-follower game
- An improved proximal alternating direction method for monotone variational inequalities with separable structure
- An alternating direction method for second-order conic programming
- Stable analysis of compressive principal component pursuit
- Optimal matrix pencil approximation problem in structural dynamic model updating
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- Proximal alternating directions method for structured variational inequalities
- A note on the alternating direction method of multipliers
- On the \(O(1/t)\) convergence rate of the alternating direction method with LQP regularization for solving structured variational inequality problems
- 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
- An inexact alternating direction method for solving a class of structured variational inequalities
- Alternating direction method for bi-quadratic programming
- A new descent alternating direction method with LQP regularization for the structured variational inequalities
- An alternating direction method with increasing penalty for stable principal component pursuit
- Convergence analysis of the generalized alternating direction method of multipliers with logarithmic-quadratic proximal regularization
- SQP alternating direction method with a new optimal step size for solving variational inequality problems with separable structure
- Principal component analysis based on nuclear norm minimization
- Prediction-correction alternating direction method for a class of constrained min-max problems
- On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers
- A self-adaptive descent LQP alternating direction method for the structured variational inequalities
- Decomposition methods based on augmented Lagrangians: a survey
- An improved proximal-based decomposition method for structured monotone variational inequalities
- A survey on some recent developments of alternating direction method of multipliers
- The developments of proximal point algorithms
- The improvement with relative errors of He et al.'s inexact alternating direction method for monotone variational inequalities
- 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
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- A simple alternating direction method for the conic trust region subproblem
- Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization
This page was built for publication: A variable-penalty alternating directions method for convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290650)
