Variable metric primal-dual method for convex optimization problems with changing constraints
From MaRDI portal
Publication:6043906
Recommendations
- Primal-dual method for optimization problems with changing constraints
- Running Primal-Dual Gradient Method for Time-Varying Nonconvex Problems
- A variable metric method for nonsmooth convex constrained optimization
- Primal-dual stochastic distributed algorithm for constrained convex optimization
- Convergence rates of inertial primal-dual dynamical methods for separable convex optimization problems
Cites work
- scientific article; zbMATH DE number 4063877 (Why is no real title available?)
- scientific article; zbMATH DE number 2076856 (Why is no real title available?)
- scientific article; zbMATH DE number 3220353 (Why is no real title available?)
- scientific article; zbMATH DE number 7656026 (Why is no real title available?)
- A variable-penalty alternating directions method for convex optimization
- Convex Analysis
- Distributed Optimization Over Time-Varying Directed Graphs
- Distributed multi-agent optimization with state-dependent communication
Cited in
(4)- Primal-dual method for optimization problems with changing constraints
- Inexact variable metric method for convex-constrained optimization problems
- Stable Convergence of a Primal-Dual Method for Multi-agent Optimization Problems
- scientific article; zbMATH DE number 3852805 (Why is no real title available?)
This page was built for publication: Variable metric primal-dual method for convex optimization problems with changing constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6043906)