Network manipulation algorithm based on inexact alternating minimization

DOI10.1007/S10287-022-00429-9OpenAlexW3178569457MaRDI QIDQ2109010FDOQ2109010

Authors David Müller, Vladimir Shikhman 

Publication date 20 December 2022

Published in Computational Management Science (Search for Journal in Brave)

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

zbMATH Keywords

discrete choicestrong convexityinexact alternating minimizationnetwork manipulation

Mathematics Subject Classification ID

Convex programming (90C25) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Operations research and management science (90Bxx)

Recommendations

• Event and Its Application in Algebraic Structures
• Distributed decision-making algorithms with multiple manipulative actors
• Inexact dual averaging method for distributed multi-agent optimization
• Distributed inexact dual consensus ADMM for network resource allocation
• Opinion manipulation in social networks

Cites work

• scientific article; zbMATH DE number 3622697 (Why is no real title available?)
• scientific article; zbMATH DE number 858900 (Why is no real title available?)
• An optimal randomized incremental gradient method
• Conditional gradient sliding for convex optimization
• DISCRETE CHOICE AND RATIONAL INATTENTION: A GENERAL EQUIVALENCE RESULT
• Discrete Choice Methods with Simulation
• Discrete choice prox-functions on the simplex
• Dynamic pricing under nested logit demand
• Error bounds and convergence analysis of feasible descent methods: A general approach
• First-order and stochastic optimization methods for machine learning
• First-order methods in optimization
• Globally convergent block-coordinate techniques for unconstrained optimization
• Gradient methods for problems with inexact model of the objective
• Lectures on convex optimization
• Markov chains. From theory to implementation and experimentation
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes
• Opinion dynamics and learning in social networks
• Reaching a Consensus
• Smooth minimization of non-smooth functions
• Smooth unbiased multivariate probability simulators for maximum likelihood estimation of limited dependent variable models
• Smoothing and first order methods: a unified framework
• Soft clustering by convex electoral model

Cited in

(2)

• Network manipulation algorithm based on inexact alternating minimization
• An algorithm for the minimum variance point of a network

This page was built for publication: Network manipulation algorithm based on inexact alternating minimization

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