Network manipulation algorithm based on inexact alternating minimization
From MaRDI portal
Publication:2109010
DOI10.1007/s10287-022-00429-9OpenAlexW3178569457MaRDI QIDQ2109010
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
Programming involving graphs or networks (90C35) Convex programming (90C25) Applications of mathematical programming (90C90) Operations research and management science (90Bxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- Opinion dynamics and learning in social networks
- Lectures on convex optimization
- 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
- An optimal randomized incremental gradient method
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Soft clustering by convex electoral model
- Gradient methods for problems with inexact model of the objective
- First-order and stochastic optimization methods for machine learning
- Conditional Gradient Sliding for Convex Optimization
- Smoothing and First Order Methods: A Unified Framework
- On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes
- Discrete Choice Methods with Simulation
- Globally convergent block-coordinate techniques for unconstrained optimization
- First-Order Methods in Optimization
- Reaching a Consensus
- DISCRETE CHOICE AND RATIONAL INATTENTION: A GENERAL EQUIVALENCE RESULT
- Dynamic pricing under nested logit demand
- Discrete Choice Prox-Functions on the Simplex
- Markov Chains
This page was built for publication: Network manipulation algorithm based on inexact alternating minimization
