Boyd, Stephen
Stanford University
8 papers on CoChatORCID 0000-0001-8353-6000
Most cited papers
- Verified
Convex Optimization
Boyd, S., & Vandenberghe, L. (2004) · Cambridge University Press eBooks
Advanced Optimization Algorithms ResearchOptimization and Variational Analysis
Cited by 56,601
- Verified
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning
Stochastic Gradient Optimization TechniquesDistributed Control Multi-Agent Systems
Cited by 17,075
- Verified
Proximal Algorithms
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization
Optimization and Variational AnalysisStochastic Gradient Optimization Techniques
Cited by 4,102
- Verified
Randomized gossip algorithms
Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006) · IEEE Transactions on Information Theory
Distributed Control Multi-Agent SystemsComplex Network Analysis Techniques
Cited by 2,439
- Verified
Disciplined Convex Programming
Grant, M., Boyd, S., & Ye, Y. (2006) · Nonconvex Optimization and Its Applications
Advanced Optimization Algorithms ResearchOptimization and Variational Analysis
Cited by 1,026
- Verified
Variations and extension of the convex–concave procedure
Lipp, T., & Boyd, S. (2016) · Optimization and Engineering
Advanced Optimization Algorithms ResearchOptimization and Variational Analysis
Cited by 744
- Verified
Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
O’Donoghue, B., Chu, E., Parikh, N., & Boyd, S. (2016) · Journal of Optimization Theory and Applications
Advanced Optimization Algorithms ResearchOptimization and Variational Analysis
Cited by 664
- Verified
Dynamic Energy Management
Moehle, N., Busseti, E., Boyd, S., & Wytock, M. (2019) · Springer Optimization and Its Applications
Electric Power System OptimizationOptimal Power Flow Distribution
Cited by 20
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free