Accelerating multi-block constrained optimization by learning penalty parameters
From MaRDI portal
Cites work
- A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications
- A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-Quadratic Regularized Optimal Transport Problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A multiscale semi-smooth Newton method for optimal transport
- A sparse smoothing Newton method for solving discrete optimal transport problems
- An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems
- An Interior Point–Inspired Algorithm for Linear Programs Arising in Discrete Optimal Transport
- Atomic decomposition by basis pursuit
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Computational optimal transport. With applications to data sciences
- CVXPY: a Python-embedded modeling language for convex optimization
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- LSALSA: accelerated source separation via learned sparse coding
- Multiplier and gradient methods
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
- Optimization methods for large-scale machine learning
- QPPAL: A Two-phase Proximal Augmented Lagrangian Method for High-dimensional Convex Quadratic Programming Problems
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
This page was built for publication: Accelerating multi-block constrained optimization by learning penalty parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7364420)
