Primal-dual method for optimization problems with changing constraints

DOI10.1007/978-3-031-09607-5_4MaRDI QIDQ2104289zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 7 December 2022

Full work available at URL https://arxiv.org/abs/2201.00334

zbMATH Keywords

changing constraintsconstrained multi-agent optimizationconvex optimizationfeasibility problemprimal-dual method

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Variable metric primal-dual method for convex optimization problems with changing constraints
• Running Primal-Dual Gradient Method for Time-Varying Nonconvex Problems
• Primal-dual mirror descent method for constraint stochastic optimization problems
• Asymptotic convergence of constrained primal-dual dynamics
• A fully stochastic primal-dual algorithm

Cites work

• A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
• A new upper bound for eigenvalues of the Laplacian matrix of a graph
• A proximal-based deomposition method for compositions method for convex minimization problems
• Distributed multi-agent optimization with state-dependent communication
• Distributed Optimization Over Time-Varying Directed Graphs
• scientific article; zbMATH DE number 3148887 (Why is no real title available?)
• scientific article; zbMATH DE number 3881348 (Why is no real title available?)
• scientific article; zbMATH DE number 4139503 (Why is no real title available?)
• scientific article; zbMATH DE number 4063877 (Why is no real title available?)
• scientific article; zbMATH DE number 3700567 (Why is no real title available?)
• scientific article; zbMATH DE number 1266748 (Why is no real title available?)
• scientific article; zbMATH DE number 3220353 (Why is no real title available?)
• Sharp upper bounds for the Laplacian graph eigenvalues

Cited in

(4)

• Variable metric primal-dual method for convex optimization problems with changing constraints
• Primal-Dual Method for Optimization Problems with Changing Constraints
• Stable Convergence of a Primal-Dual Method for Multi-agent Optimization Problems
• The primal-dual algorithm as a constraint-set-manipulation device

This page was built for publication: Primal-dual method for optimization problems with changing constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104289)