Proximal Decomposition Via Alternating Linearization
From MaRDI portal
Recommendations
- An approximate alternating linearization decomposition method
- A proximal alternating linearization method for minimizing the sum of two convex functions
- A proximal alternating linearization method for nonconvex optimization problems
- Fast alternating linearization methods for minimizing the sum of two convex functions
- A proximal-based deomposition method for compositions method for convex minimization problems
Cited in
(43)- A novel approach for solving semidefinite programs
- A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A selective linearization method for multiblock convex optimization
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
- The symmetric ADMM with indefinite proximal regularization and its application
- Proximal-point algorithm using a linear proximal term
- A parallel splitting ALM-based algorithm for separable convex programming
- Proximal linearization methods for Schatten p-quasi-norm minimization
- Robust multicategory support vector machines using difference convex algorithm
- Inexact proximal penalty alternating linearization decomposition scheme of nonsmooth convex constrained optimization problems
- Proximal decomposition of convex optimization via an alternating linearization algorithm with inexact oracles
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
- Selective linearization for multi-block statistical learning
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
- Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
- An approximate alternating linearization decomposition method
- A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming
- A class of alternating linearization algorithms for nonsmooth convex optimization
- An alternating linearization method with inexact data for bilevel nonsmooth convex optimization
- A survey on operator splitting and decomposition of convex programs
- An alternating direction method for second-order conic programming
- An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems
- A proximal alternating linearization method for nonconvex optimization problems
- Efficient algorithms for robust and stable principal component pursuit problems
- A note on the alternating direction method of multipliers
- A Decomposition Method and Its Application to Convex Programming
- A proximal alternating linearization method for minimizing the sum of two convex functions
- An augmented Lagrangian method for distributed optimization
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Proximal linear maps
- On the optimal proximal parameter of an ADMM-like splitting method for separable convex programming
- An Efficient Algorithm for Minimizing Multi Non-Smooth Component Functions
- Efficiency of proximal bundle methods
- Decomposition methods based on augmented Lagrangians: a survey
- A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
- 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
- scientific article; zbMATH DE number 6378171 (Why is no real title available?)
- Block coordinate descent methods for semidefinite programming
This page was built for publication: Proximal Decomposition Via Alternating Linearization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702304)
