- Shuoguang Yang, Wei You, Zhe Zhang, Ethan X. Fang. Stochastic Compositional Optimization with Compositional Constraints. INFORMS J. Optim., 8(1):1-21, 2026.
- Bofan Wang, Shiqian Ma, Junfeng Yang, Danqing Zhou. Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration Without Momentum. INFORMS J. Optim., 8(2):141-162, 2026.
- Alberto Del Pia, Dekun Zhou. A Semidefinite Programming Relaxation for the Sparse Integer Least Squares Problem. INFORMS J. Optim., 8(1):22-40, 2026.
- Alvaro Maggiar, Lee Dicker, Michael W. Mahoney. Consensus Planning with Primal, Dual, and Proximal Agents. INFORMS J. Optim., 8(2):95-119, 2026.
- Editorial Board. INFORMS J. Optim., 8(1), 2026.
- Julien Pallage, Antoine Lesage-Landry. Wasserstein Distributionally Robust Shallow Convex Neural Networks. INFORMS J. Optim., 8(1):61-93, 2026.
- Dominic Keehan, Andrew B. Philpott, Edward J. Anderson. On the Out-of-Sample Performance of Stochastic Dynamic Programming and Model Predictive Control. INFORMS J. Optim., 8(1):41-60, 2026.
- Shixuan Zhang, Xu Andy Sun. On Distributionally Robust Multistage Convex Optimization: Data-Driven Models and Performance. INFORMS J. Optim., 8(2):120-140, 2026.
- Kiera W. Dobbs, Douglas M. King, Sheldon H. Jacobson. Finding Shortest Flip Sequences Between Connected Graph Partitions. INFORMS J. Optim., 8(2):163-184, 2026.
- Mitas Ray, Omid Sadeghi, Lillian J. Ratliff, Maryam Fazel. Function Design for Improved Competitive Ratio in Online Resource Allocation with Procurement Costs. INFORMS J. Optim., 7(1):20-37, 2025.