source/main.bib

@article{pedramfar2024linear,
  title={From linear to linearizable optimization: A novel framework with applications to stationary and non-stationary dr-submodular optimization},
  author={Pedramfar, Mohammad and Aggarwal, Vaneet},
  journal={Advances in Neural Information Processing Systems},
  volume={37},
  pages={37626--37664},
  year={2024}
}
@article{pedramfar2026gamma,
  title={$\gamma$-weakly $\theta$-up-concavity: Linearizable Non-Convex Optimization with Applications to DR-Submodular and OSS Functions},
  author={Pedramfar, Mohammad and Aggarwal, Vaneet},
  journal={arXiv preprint arXiv:2602.13506},
  year={2026}
}
@article{pedramfar2024unifiedonline,
  title={A Unified Approach for Maximizing Continuous $\gamma$-Weakly DR-Submodular Functions},
  author={Pedramfar, Mohammad and Quinn, Christopher and Aggarwal, Vaneet},
  journal={Optimization Online},
  year={2024},
  month={mar}
}
@inproceedings{jadav2026stronger,
  title={Stronger Approximation Guarantees for Non-Monotone $\gamma$-Weakly DR-Submodular Maximization},
  author={Jadav, Hareshkumar and Singh, Ranveer and Aggarwal, Vaneet},
  booktitle={Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS)},
  year={2026},
  month={may}
}
@article{
lu2025decentralized,
title={Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to {DR}-Submodular Optimization},
author={Yiyang Lu and Mohammad Pedramfar and Vaneet Aggarwal},
journal={Transactions on Machine Learning Research},
issn={2835-8856},
year={2025}
}
@inproceedings{
pedramfar2025uniform,
title={Uniform Wrappers: Bridging Concave to Quadratizable Functions in Online Optimization},
author={Mohammad Pedramfar and Christopher John Quinn and Vaneet Aggarwal},
booktitle={The Thirty-ninth Annual Conference on Neural Information Processing Systems},
year={2025}
}
@inproceedings{
pedramfar2024unified,
title={Unified Projection-Free Algorithms for Adversarial {DR}-Submodular Optimization},
author={Mohammad Pedramfar and Yididiya Y. Nadew and Christopher John Quinn and Vaneet Aggarwal},
booktitle={The Twelfth International Conference on Learning Representations},
year={2024}
}
@article{pedramfar2023unified,
  title={A unified approach for maximizing continuous DR-submodular functions},
  author={Pedramfar, Mohammad and Quinn, Christopher and Aggarwal, Vaneet},
  journal={Advances in Neural Information Processing Systems},
  volume={36},
  pages={61103--61114},
  year={2023}
}
@inproceedings{thang2021online,
  title={Online non-monotone DR-submodular maximization},
  author={Thang, Nguyen Kim and Srivastav, Abhinav},
  booktitle={Proceedings of the AAAI Conference on Artificial Intelligence},
  volume={35},
  number={11},
  pages={9868--9876},
  year={2021}
}

@inproceedings{zhang2023online,
  title={Online learning for non-monotone DR-submodular maximization: From full information to bandit feedback},
  author={Zhang, Qixin and Deng, Zengde and Chen, Zaiyi and Zhou, Kuangqi and Hu, Haoyuan and Yang, Yu},
  booktitle={International Conference on Artificial Intelligence and Statistics},
  pages={3515--3537},
  year={2023},
  organization={PMLR}
}

@inproceedings{buchbinder2024constrained,
  title={Constrained submodular maximization via new bounds for dr-submodular functions},
  author={Buchbinder, Niv and Feldman, Moran},
  booktitle={Proceedings of the 56th Annual ACM Symposium on Theory of Computing},
  pages={1820--1831},
  year={2024}
}

@inproceedings{garber2022new,
	title = {New Projection-free Algorithms for Online Convex Optimization with Adaptive Regret Guarantees},
	eventtitle = {Conference on Learning Theory},
	pages = {2326--2359},
	booktitle = {Proceedings of Thirty Fifth Conference on Learning Theory},
	publisher = {{PMLR}},
	author = {Garber, Dan and Kretzu, Ben},
	date = {2022-06-28},
    year = 2022,
	langid = {english},
}

@inproceedings{hazan2012projection,
  title={Projection-free online learning},
  author={Hazan, Elad and Kale, Satyen},
  booktitle={Proceedings of the 29th International Conference on Machine Learning},
  pages={1843--1850},
  year={2012}
}


@inproceedings{hazan2009efficient,
  title={Efficient learning algorithms for changing environments},
  author={Hazan, Elad and Seshadhri, Comandur},
  booktitle={Proceedings of the 26th annual international conference on machine learning},
  pages={393--400},
  year={2009}
}

@inproceedings{jaggi2013revisiting,
  title={Revisiting Frank-Wolfe: Projection-free sparse convex optimization},
  author={Jaggi, Martin},
  booktitle={International conference on machine learning},
  pages={427--435},
  year={2013},
  organization={PMLR}
}

@article{zhang2018adaptive,
  title={Adaptive online learning in dynamic environments},
  author={Zhang, Lijun and Lu, Shiyin and Zhou, Zhi-Hua},
  journal={Advances in neural information processing systems},
  volume={31},
  year={2018}
}

@inproceedings{zinkevich2003online,
  title={Online convex programming and generalized infinitesimal gradient ascent},
  author={Zinkevich, Martin},
  booktitle={Proceedings of the 20th international conference on machine learning (icml-03)},
  pages={928--936},
  year={2003}
}

@article{zhao2021bandit,
  title={Bandit convex optimization in non-stationary environments},
  author={Zhao, Peng and Wang, Guanghui and Zhang, Lijun and Zhou, Zhi-Hua},
  journal={Journal of Machine Learning Research},
  volume={22},
  number={125},
  pages={1--45},
  year={2021}
}

@article{streeter2008online,
  title={An online algorithm for maximizing submodular functions},
  author={Streeter, Matthew and Golovin, Daniel},
  journal={Advances in Neural Information Processing Systems},
  volume={21},
  year={2008}
}

@inproceedings{zhang2022stochastic,
  title={Stochastic continuous submodular maximization: Boosting via non-oblivious function},
  author={Zhang, Qixin and Deng, Zengde and Chen, Zaiyi and Hu, Haoyuan and Yang, Yu},
  booktitle={International Conference on Machine Learning},
  pages={26116--26134},
  year={2022},
  organization={PMLR}
}

@article{hassani2017gradient,
  title={Gradient methods for submodular maximization},
  author={Hassani, Hamed and Soltanolkotabi, Mahdi and Karbasi, Amin},
  journal={Advances in Neural Information Processing Systems},
  volume={30},
  year={2017}
}

@inproceedings{chen2018online,
  title={Online continuous submodular maximization},
  author={Chen, Lin and Hassani, Hamed and Karbasi, Amin},
  booktitle={International Conference on Artificial Intelligence and Statistics},
  pages={1896--1905},
  year={2018},
  organization={PMLR}
}

@inproceedings{fazel2023fast,
  title={Fast first-order methods for monotone strongly dr-submodular maximization},
  author={Fazel, Maryam and Sadeghi, Omid},
  booktitle={SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23)},
  pages={169--179},
  year={2023},
  organization={SIAM}
}

@InProceedings{bian17guaran,
  title = {{Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains}},
  author = {Bian, Andrew An and Mirzasoleiman, Baharan and Buhmann, Joachim and Krause, Andreas},
  booktitle = {Proceedings of the 20th International Conference on Artificial Intelligence and Statistics},
  year = 	 {2017},
  month = apr,
}

@inproceedings{bian2019optimal,
  title={Optimal continuous DR-submodular maximization and applications to provable mean field inference},
  author={Bian, Yatao and Buhmann, Joachim and Krause, Andreas},
  booktitle={International Conference on Machine Learning},
  pages={644--653},
  year={2019},
  organization={PMLR}
}

@article{ito2016large,
  title={Large-scale price optimization via network flow},
  author={Ito, Shinji and Fujimaki, Ryohei},
  journal={Advances in Neural Information Processing Systems},
  volume={29},
  year={2016}
}

@article{gu2023profit,
  title={Profit maximization in social networks and non-monotone DR-submodular maximization},
  author={Gu, Shuyang and Gao, Chuangen and Huang, Jun and Wu, Weili},
  journal={Theoretical Computer Science},
  volume={957},
  pages={113847},
  year={2023},
  publisher={Elsevier}
}

@article{aldrighetti2021costs,
  title={Costs of resilience and disruptions in supply chain network design models: a review and future research directions},
  author={Aldrighetti, Riccardo and Battini, Daria and Ivanov, Dmitry and Zennaro, Ilenia},
  journal={International Journal of Production Economics},
  volume={235},
  pages={108103},
  year={2021},
  publisher={Elsevier}
}

@article{mishra2017comprehensive,
  title={A comprehensive review on power distribution network reconfiguration},
  author={Mishra, Sivkumar and Das, Debapriya and Paul, Subrata},
  journal={Energy Systems},
  volume={8},
  number={2},
  pages={227--284},
  year={2017},
  publisher={Springer}
}

@article{zhang2024boosting,
  title={Boosting gradient ascent for continuous dr-submodular maximization},
  author={Zhang, Qixin and Wan, Zongqi and Deng, Zengde and Chen, Zaiyi and Sun, Xiaoming and Zhang, Jialin and Yang, Yu},
  journal={arXiv preprint arXiv:2401.08330},
  year={2024}
}

@article{li2023experimental,
  title={Experimental design networks: A paradigm for serving heterogeneous learners under networking constraints},
  author={Li, Yuanyuan and Liu, Yuezhou and Su, Lili and Yeh, Edmund and Ioannidis, Stratis},
  journal={IEEE/ACM Transactions on Networking},
  volume={31},
  number={5},
  pages={2236--2250},
  year={2023},
  publisher={IEEE}
}

@inproceedings{alon2012optimizing,
  title={Optimizing budget allocation among channels and influencers},
  author={Alon, Noga and Gamzu, Iftah and Tennenholtz, Moshe},
  booktitle={Proceedings of the 21st international conference on World Wide Web},
  pages={381--388},
  year={2012}
}

@article{buchbinder2019constrained,
  title={Constrained submodular maximization via a nonsymmetric technique},
  author={Buchbinder, Niv and Feldman, Moran},
  journal={Mathematics of Operations Research},
  volume={44},
  number={3},
  pages={988--1005},
  year={2019},
  publisher={INFORMS}
}

@inproceedings{gharan2011submodular,
  title={Submodular maximization by simulated annealing},
  author={Gharan, Shayan Oveis and Vondr{\'a}k, Jan},
  booktitle={Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms},
  pages={1098--1116},
  year={2011},
  organization={SIAM}
}

@article{qi2024maximizing,
  title={On maximizing sums of non-monotone submodular and linear functions},
  author={Qi, Benjamin},
  journal={Algorithmica},
  volume={86},
  number={4},
  pages={1080--1134},
  year={2024},
  publisher={Springer}
}

@inproceedings{bian2017continuous,
  title={Continuous dr-submodular maximization: Structure and algorithms},
  author={Bian, An and Levy, Kfir and Krause, Andreas and Buhmann, Joachim M},
  booktitle={Advances in Neural Information Processing Systems},
  volume={30},
  year={2017}
}

@inproceedings{mualem2023resolving,
  title={Resolving the approximability of offline and online non-monotone dr-submodular maximization over general convex sets},
  author={Mualem, Liel and Feldman, Moran},
  booktitle={International Conference on Artificial Intelligence and Statistics},
  pages={4776--4793},
  year={2023},
  organization={PMLR}
}

@article{lu2025bagel,
  title={BAGEL: Projection-Free Algorithm for Adversarially Constrained Online Convex Optimization},
  author={Lu, Yiyang and Pedramfar, Mohammad and Aggarwal, Vaneet},
  journal={arXiv preprint arXiv:2502.16744},
  year={2025}
}

@article{sarkar2025online,
  title={Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints},
  author={Sarkar, Dhruv and Mukhopadhyay, Samrat and Sinha, Abhishek},
  journal={arXiv preprint arXiv:2508.16992},
  year={2025}
}