Primal-dual method for optimization problems with changing constraints

DOI10.1007/978-3-031-09607-5_4OpenAlexW4285180444MaRDI QIDQ2104289

Yanyan Li

Publication date: 7 December 2022

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

zbMATH Keywords

convex optimizationprimal-dual methodfeasibility problemchanging constraintsconstrained multi-agent optimization

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• Distributed multi-agent optimization with state-dependent communication
• A proximal-based deomposition method for compositions method for convex minimization problems
• A new upper bound for eigenvalues of the Laplacian matrix of a graph
• Sharp upper bounds for the Laplacian graph eigenvalues
• Distributed Optimization Over Time-Varying Directed Graphs
• A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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