A class of linearized proximal alternating direction methods
From MaRDI portal
Publication:658552
DOI10.1007/S10957-011-9876-5zbMATH Open1242.90168OpenAlexW2043275203MaRDI QIDQ658552FDOQ658552
Publication date: 12 January 2012
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9876-5
Recommendations
- Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization
- A linearized alternating direction method of multipliers with substitution procedure
- Convergence of alternating directions like methods for linearly constrained structured variational inequalities
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- An alternating direction-based contraction method for linearly constrained separable convex programming problems
alternating direction methodproximal point methodaugmented Lagrangian methodstructured optimization problem
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
- Title not available (Why is that?)
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A new inexact alternating directions method for monotone variational inequalities
- Handbook of applied optimization
- Encyclopedia of Optimization
- Title not available (Why is that?)
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A general formulation of alternating direction methods. I: Parabolic and hyperbolic problems
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- State Constraints in Convex Control Problems of Bolza
- Navigating in a Graph by Aid of Its Spanning Tree Metric
- A variable-penalty alternating directions method for convex optimization
- Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- Nonlinear analysis and variational problems. In Honor of George Isac
- Proximal alternating directions method for structured variational inequalities
- Title not available (Why is that?)
Cited In (31)
- A novel approach for solving semidefinite programs
- An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization
- Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem
- Alternating direction method of multipliers with variable metric indefinite proximal terms for convex optimization
- Improved proximal ADMM with partially parallel splitting for multi-block separable convex programming
- The symmetric ADMM with indefinite proximal regularization and its application
- Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method
- Proximal linearization methods for Schatten \(p\)-quasi-norm minimization
- On inexact ADMMs with relative error criteria
- An inexact accelerated stochastic ADMM for separable convex optimization
- An algorithm twisted from generalized ADMM for multi-block separable convex minimization models
- On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models
- A new implementable prediction-correction method for monotone variational inequalities with separable structure
- A proximal ADMM with the Broyden family for convex optimization problems
- A proximal alternating linearization method for nonconvex optimization problems
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
- Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems
- The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization
- Proximal linear maps
- A homotopy alternating direction method of multipliers for linearly constrained separable convex optimization
- Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications
- Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
- Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis
- The PRIMPING routine -- tiling through proximal alternating linearized minimization
- A survey on some recent developments of alternating direction method of multipliers
- Inertial alternating direction method of multipliers for non-convex non-smooth optimization
- Title not available (Why is that?)
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- A partially proximal S-ADMM for separable convex optimization with linear constraints
- Convergence revisit on generalized symmetric ADMM
Uses Software
This page was built for publication: A class of linearized proximal alternating direction methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658552)
