A variable-penalty alternating directions method for convex optimization
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 3849051 (Why is no real title available?)
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 4009672 (Why is no real title available?)
- scientific article; zbMATH DE number 4068623 (Why is no real title available?)
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 679861 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- A Parallel Algorithm for a Class of Convex Programs
- A diagonal quadratic approximation method for large scale linear programs
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A proximal-based deomposition method for compositions method for convex minimization problems
- Alternating direction splittings for block angular parallel optimization
- Application of the alternating direction method of multipliers to separable convex programming problems
- Applications of the method of partial inverses to convex programming: Decomposition
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Lectures on optimization - theory and algorithms. Notes by M. K. V. Murthy
- Multicommodity network flows—A survey
- Multiplier and gradient methods
- Multiplier methods: A survey
- Multipoint methods for separable nonlinear networks
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- On the convergence of the exponential multiplier method for convex programming
- On the gradient-projection method for solving the nonsymmetric linear complementarity problem
- Partial inverse of a monotone operator
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Secant approximation methods for convex optimization
- Solving multistage stochastic networks: An application of scenario aggregation
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Test of probabilistic models for the propagation of roundoff errors
- The Fermat-Weber location problem revisited
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- The multiplier method of Hestenes and Powell applied to convex programming
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
Cited in
(64)- A new penalty dual-primal augmented Lagrangian method and its extensions
- A separable surrogate function method for sparse and low-rank matrices decomposition
- Variable metric primal-dual method for convex optimization problems with changing constraints
- On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems
- An efficient simultaneous method for the constrained multiple-sets split feasibility problem
- Principal component analysis based on nuclear norm minimization
- An LQP-SQP alternating direction method for solving variational inequality problems with separable structure
- Prediction-correction alternating direction method for a class of constrained min-max problems
- An alternating direction method with increasing penalty for stable principal component pursuit
- Alternating conditional gradient method for convex feasibility problems
- 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
- Decomposition methods based on augmented Lagrangians: a survey
- Block coordinate descent methods for semidefinite programming
- A class of linearized proximal alternating direction methods
- New descent LQP alternating direction methods for solving a class of structured variational inequalities
- Stable analysis of compressive principal component pursuit
- On the linear convergence of the alternating direction method of multipliers
- On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming
- New parallel descent-like method for solving a class of variational inequalities
- A new decomposition method for variational inequalities with linear constraints
- A descent LQP alternating direction method for solving variational inequality problems with separable structure
- Optimal matrix pencil approximation problem in structural dynamic model updating
- 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
- The improvement with relative errors of He et al.'s inexact alternating direction method for monotone variational inequalities
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- An inexact LQP alternating direction method for solving a class of structured variational inequalities
- 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
- A computation study on an integrated alternating direction method of multipliers for large scale optimization
- An improved proximal-based decomposition method for structured monotone variational inequalities
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- An augmented Lagrangian-based parallel splitting method for a one-leader-two-follower game
- Inexact penalty decomposition methods for optimization problems with geometric constraints
- Parallel 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
- scientific article; zbMATH DE number 7307482 (Why is no real title available?)
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- An improved prediction-correction method for monotone variational inequalities with separable operators
- A simple alternating direction method for the conic trust region subproblem
- An improved proximal alternating direction method for monotone variational inequalities with separable structure
- High-order total variation regularization approach for axially symmetric object tomography from a single radiograph
- Approximation schemes for materials with discontinuities
- A survey on some recent developments of alternating direction method of multipliers
- An inexact alternating direction method for solving a class of structured variational inequalities
- Alternating direction method for covariance selection models
- A survey on operator splitting and decomposition of convex programs
- Efficient iterative solution of finite element discretized nonsmooth minimization problems
- Alternating direction method for structure-persevering finite element model updating problem
- Proximal alternating directions method for structured variational inequalities
- On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers
- An LQP-based symmetric alternating direction method of multipliers with larger step sizes
- An alternating direction method for second-order conic programming
- An ADM-based splitting method for separable convex programming
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis
- SQP alternating direction method with a new optimal step size for solving variational inequality problems with separable structure
- A self-adaptive descent LQP alternating direction method for the structured variational inequalities
- The developments of proximal point algorithms
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- A new descent alternating direction method with LQP regularization for the structured variational inequalities
- Alternating direction method for bi-quadratic programming
- Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization
- An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
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)
