Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

DeepDyve requires Javascript to function. Please enable Javascript on your browser to continue.

Mathematics of Operations Research New!

Subject Areas: Computer Science Applications
Publisher: Edinburgh University Press - INFORMS
ISSN: 0364-765X
SJR: 81

Download Only

Journal Article

Robust-to-Dynamics Optimization

Ahmadi, Amir Ali; Günlük, Oktay

2024 Mathematics of Operations Research

doi:10.1287/moor.2023.0116

A robust-to-dynamics optimization (RDO) problem is an optimization problem specified by two pieces of input: (i) a mathematical program (an objective function f:Rn→R and a feasible set Ω⊆Rn) and (ii) a dynamical system (a map g:Rn→Rn). Its goal is to minimize f over the set S⊆Ω of initial...
Download Only

Journal Article

On Constrained Mixed-Integer DR-Submodular Minimization

Yu, Qimeng; Küçükyavuz, Simge

2024 Mathematics of Operations Research

doi:10.1287/moor.2022.0320

Diminishing returns (DR)–submodular functions encompass a broad class of functions that are generally nonconvex and nonconcave. We study the problem of minimizing any DR-submodular function with continuous and general integer variables under box constraints and, possibly, additional monotonicity...
Download Only

Journal Article

Finite-Time High-Probability Bounds for Polyak–Ruppert Averaged Iterates of Linear Stochastic Approximation

Durmus, Alain; Moulines, Eric; Naumov, Alexey; Samsonov, Sergey

2024 Mathematics of Operations Research

doi:10.1287/moor.2022.0179

This paper provides a finite-time analysis of linear stochastic approximation (LSA) algorithms with fixed step size, a core method in statistics and machine learning. LSA is used to compute approximate solutions of a d-dimensional linear system A¯θ=b¯ for which (A¯,b¯) can only be estimated by...
Download Only

Journal Article

Opinion Dynamics on Directed Complex Networks

Fraiman, Nicolas; Lin, Tzu-Chi; Olvera-Cravioto, Mariana

2024 Mathematics of Operations Research

doi:10.1287/moor.2022.0250

We propose and analyze a mathematical model for the evolution of opinions on directed complex networks. Our model generalizes the popular DeGroot and Friedkin-Johnsen models by allowing vertices to have attributes that may influence the opinion dynamics. We start by establishing sufficient...
Download Only

Journal Article

Simple and Explicit Bounds for Multiserver Queues with 11−ρ Scaling

Li, Yuan; Goldberg, David A.

2024 Mathematics of Operations Research

doi:10.1287/moor.2022.0131

We consider the first-come-first-serve (FCFS) GI/GI/n queue and prove the first simple and explicit bounds that scale as 11−ρ under only the assumption that interarrival times have finite second moment, and service times have finite 2+ϵ moment for some ϵ>0. Here, ρ denotes the corresponding...
Download Only

Journal Article

Practical Algorithms with Guaranteed Approximation Ratio for Traveling Tournament Problem with Maximum Tour Length 2

Zhao, Jingyang; Xiao, Mingyu

2024 Mathematics of Operations Research

doi:10.1287/moor.2022.0356

The traveling tournament problem (TTP) is a hard but interesting sports scheduling problem inspired by Major League Baseball, which is to design a double round-robin schedule such that each pair of teams plays one game in each other’s home venue, minimizing the total distance traveled by all n...
Download Only

Journal Article

Efficiency of Stochastic Coordinate Proximal Gradient Methods on Nonseparable Composite Optimization

Necoara, Ion; Chorobura, Flavia

2024 Mathematics of Operations Research

doi:10.1287/moor.2023.0044

This paper deals with composite optimization problems having the objective function formed as the sum of two terms; one has a Lipschitz continuous gradient along random subspaces and may be nonconvex, and the second term is simple and differentiable but possibly nonconvex and nonseparable. Under...

results per page

Prev
1
Next