Proximal Decomposition Via Alternating Linearization
From MaRDI portal
Publication:4702304
DOI10.1137/S1052623495288064zbMath0958.65068MaRDI QIDQ4702304
Ruszczyński, Andrzej, Krzysztof C. Kiwiel, Charles H. Rosa
Publication date: 24 November 1999
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
stochastic programmingdecompositionnumerical examplesconvex programmingaugmented Lagrangianslarge scale optimizationproximal point methods
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Stochastic programming (90C15) Interior-point methods (90C51)
Related Items
A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming, The symmetric ADMM with indefinite proximal regularization and its application, Decomposition Methods Based on Augmented Lagrangians: A Survey, An Efficient Algorithm for Minimizing Multi Non-Smooth Component Functions, An alternating direction method for second-order conic programming, A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem, A proximal alternating linearization method for nonconvex optimization problems, Fast alternating linearization methods for minimizing the sum of two convex functions, Distributed solutions for loosely coupled feasibility problems using proximal splitting methods, A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems, A note on the alternating direction method of multipliers, A proximal alternating linearization method for minimizing the sum of two convex functions, Alternating direction augmented Lagrangian methods for semidefinite programming, A survey on operator splitting and decomposition of convex programs, An alternating linearization method with inexact data for bilevel nonsmooth convex optimization, An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems, Efficient algorithms for robust and stable principal component pursuit problems, Proximal alternating penalty algorithms for nonsmooth constrained convex optimization, An augmented Lagrangian method for distributed optimization, Robust multicategory support vector machines using difference convex algorithm, A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework, Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization, Selective linearization for multi-block statistical learning, An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information, Block Coordinate Descent Methods for Semidefinite Programming, An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems, A parallel splitting ALM-based algorithm for separable convex programming, A class of alternating linearization algorithms for nonsmooth convex optimization, On the optimal proximal parameter of an ADMM-like splitting method for separable convex programming, Efficiency of proximal bundle methods, A novel approach for solving semidefinite programs, A Selective Linearization Method For Multiblock Convex Optimization
