Variable metric primal-dual method for convex optimization problems with changing constraints

DOI10.1134/S1995080223010237zbMATH Open1519.90172MaRDI QIDQ6043906FDOQ6043906

Authors: Igor V. Konnov 

Publication date: 25 May 2023

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

convex optimizationvariable metricmulti-agent optimizationprimal-dual methodchanging topologychanging constraints

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• Convex Analysis
• Title not available (Why is that?)
• A variable-penalty alternating directions method for convex optimization
• Distributed multi-agent optimization with state-dependent communication
• Title not available (Why is that?)
• Distributed Optimization Over Time-Varying Directed Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

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
• Title not available (Why is that?)

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)