Network manipulation algorithm based on inexact alternating minimization
From MaRDI portal
Publication:2109010
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
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
Convex programming (90C25) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Operations research and management science (90Bxx)
Cites Work
- Smooth minimization of non-smooth functions
- First-order methods in optimization
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Title not available (Why is that?)
- Discrete Choice Methods with Simulation
- Reaching a Consensus
- Opinion dynamics and learning in social networks
- Globally convergent block-coordinate techniques for unconstrained optimization
- On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes
- Smooth unbiased multivariate probability simulators for maximum likelihood estimation of limited dependent variable models
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Smoothing and first order methods: a unified framework
- Lectures on convex optimization
- Conditional gradient sliding for convex optimization
- Title not available (Why is that?)
- An optimal randomized incremental gradient method
- Markov chains. From theory to implementation and experimentation
- Gradient methods for problems with inexact model of the objective
- DISCRETE CHOICE AND RATIONAL INATTENTION: A GENERAL EQUIVALENCE RESULT
- First-order and stochastic optimization methods for machine learning
- Soft clustering by convex electoral model
- Dynamic pricing under nested logit demand
- Discrete choice prox-functions on the simplex
Cited In (2)
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)
