Search Results - "Optimization algorithms"

Fast Convergence of Frank-Wolfe Algorithms on Polytopes.

Authors: Wirth, Elias Peña, Javier Pokutta, Sebastian

Source: Mathematics of Operations Research (INFORMS). May2026, Vol. 51 Issue 2, p1463-1485. 23p.

Riemannian Anderson Mixing Methods for Minimizing C ² Functions on Riemannian Manifolds.

Authors: Li, Zanyu Bao, Chenglong

Source: Mathematics of Operations Research (INFORMS). May2026, Vol. 51 Issue 2, p905-937. 33p.

Efficient and Near-Optimal Online Portfolio Selection.

Authors: Jézéquel, Rémi Ostrovskii, Dmitrii Gaillard, Pierre

Source: Mathematics of Operations Research (INFORMS). May2026, Vol. 51 Issue 2, p1350-1384. 35p.

A Homogeneous Second-Order Descent Method for Nonconvex Optimization.

Authors: Zhang, Chuwen He, Chang Jiang, Yuntian et al.

Source: Mathematics of Operations Research (INFORMS). May2026, Vol. 51 Issue 2, p1253-1283. 31p.

A Low-Rank Augmented Lagrangian Method for Doubly Nonnegative Relaxations of Mixed-Binary Quadratic Programs.

Authors: Hou, Di Tang, Tianyun Toh, Kim-Chuan

Source: Operations Research. May/Jun2026, Vol. 74 Issue 3, p1626-1647. 22p.

Relating Electric Vehicle Charging to Speed Scaling with Job-Specific Speed Limits.

Authors: Winschermann, Leoni Antoniadis, Antonios Gerards, Marco E. T. et al.

Source: Operations Research. May/Jun2026, Vol. 74 Issue 3, p1165-1186. 22p.

Sinkhorn Distributionally Robust Optimization.

Authors: Wang, Jie Gao, Rui Xie, Yao

Source: Operations Research. May/Jun2026, Vol. 74 Issue 3, p1581-1603. 23p.

E-Commerce Middle-Mile Network Design with Delivery Speed Choices and Service Level Constraints.

Authors: Malik, Aditya Chakraborty, Shuvabrata Jayaswal, Sachin

Source: Transportation Science (INFORMS). May/Jun2026, Vol. 60 Issue 3, p405-423. 19p.

Machine Learning-Empowered Benders Decomposition for Flow Hub Location in E-Commerce.

Authors: Wu, Tao Chen, Weiwei Cordeau, Jean-François et al.

Source: INFORMS Journal on Computing. Mar/Apr2026, Vol. 38 Issue 2, p463-489. 27p.

AdaBB: Adaptive Barzilai-Borwein Method for Convex Optimization.

Authors: Zhou, Danqing Ma, Shiqian Yang, Junfeng

Source: Mathematics of Operations Research (INFORMS). Feb2026, Vol. 51 Issue 1, p715-745. 31p.

Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems.

Authors: Tran-Dinh, Quoc Luo, Yang

Source: Mathematics of Operations Research (INFORMS). Feb2026, Vol. 51 Issue 1, p746-782. 37p.

New Analysis of an Away-Step Frank–Wolfe Method for Minimizing Log-Homogeneous Barriers.

Authors: Zhao, Renbo¹ (AUTHOR) renbo-zhao@uiowa.edu

Source: Mathematics of Operations Research (INFORMS). Feb2026, Vol. 51 Issue 1, p35-59. 25p.

Inexact Bregman Proximal Gradient Method and Its Inertial Variant with Absolute and Partial Relative Stopping Criteria.

Authors: Yang, Lei Toh, Kim-Chuan

Source: Mathematics of Operations Research (INFORMS). Feb2026, Vol. 51 Issue 1, p686-714. 29p.

Convergence of Augmented Lagrangian Methods for Composite Optimization Problems.

Authors: Van Hang, Nguyen Thi Sarabi, Ebrahim

Source: Mathematics of Operations Research (INFORMS). Feb2026, Vol. 51 Issue 1, p591-620. 30p.

Optimal Partition for a Multi-Type Queueing System.

Authors: Cao, Shengyu He, Simai Wang, Zizhuo et al.

Source: Mathematics of Operations Research (INFORMS). Feb2026, Vol. 51 Issue 1, p277-298. 22p.

A Momentum-Based Linearized Augmented Lagrangian Method for Nonconvex Constrained Stochastic Optimization.

Authors: Shi, Qiankun Wang, Xiao Wang, Hao

Source: Mathematics of Operations Research (INFORMS). Feb2026, Vol. 51 Issue 1, p92-133. 42p.

Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration Without Momentum.

Authors: Wang, Bofan Ma, Shiqian Yang, Junfeng et al.

Source: INFORMS Journal on Optimization. Spring2026, Vol. 8 Issue 2, p141-162. 22p.

A Branch-and-Benders Cut Algorithm for a Stochastic Service Network Design with Crowdsourced Capacity.

Authors: Satici, Ozgur Dayarian, Iman

Source: Transportation Science (INFORMS). Mar/Apr2026, Vol. 60 Issue 2, p316-342. 27p.

FLASH-TB: Integrating Arc-Flags and Trip-Based Public Transit Routing.

Authors: Großmann, Ernestine Sauer, Jonas Schulz, Christian et al.

Source: Transportation Science (INFORMS). Mar/Apr2026, Vol. 60 Issue 2, p242-263. 22p.

A Proximal Difference-of-Convex Algorithm for Sample Average Approximation of Chance Constrained Programming.

Authors: Wang, Peng Jiang, Rujun Kong, Qingyuan et al.

Source: INFORMS Journal on Computing. Jan/Feb2026, Vol. 38 Issue 1, p315-339. 25p.