TALK KEYWORD INDEX
This page contains an index consisting of author-provided keywords.
( | |
(Gauss-)Newton methods | |
(Weakly-)convex composite | |
A | |
Acceleration techniques | |
Active-set | |
adaptive mesh refinement | |
Adaptive Sampling | |
Adaptive-partition Method | |
adaptivity | |
Adjustable robust optimization | |
ADMM | |
Advanced Manufacturing | |
Aggregators | |
airport slot allocation | |
algorithmic regularization | |
algorithms | |
Alternating Direction Method of Multipliers | |
Alternating projections | |
Analytical solution algorithm | |
Applications of Stochastic Gradient | |
approximate | |
Approximate cutting plane | |
Approximate dynamic programming | |
Approximation algorithm | |
Approximation Algorithms | |
Assignment Problems | |
Asymptotic Cone | |
Asymptotics | |
attack graphs | |
attack trees | |
auction | |
augmented Lagrangian | |
augmented Lagrangian Method | |
B | |
backtracking | |
Barvinok-Pataki Bound | |
Battery electric buses | |
Benchmarking | |
Benders Decomposition | |
Benders’ decomposition | |
Bi-level programming | |
Bi-objective Optimization | |
biconvex optimization | |
bilevel optimization | |
Bilievel Optimization | |
Binary quadratic programs | |
binary recourse variables | |
binary uncertainty | |
Biobjective mixed integer optimization | |
black-box attack | |
Boolean quadric polytope | |
bounds and approximations | |
Branch and Bound | |
Branch and cut | |
branch-and-bound | |
Branch-and-bound algorithm | |
branch-and-cut | |
Branching | |
Brownian field | |
C | |
capacitated facility location | |
capacitated lot-sizing | |
cardiac arrest | |
Causal Inference | |
Chance Constraint | |
Chance constraints | |
Chance-constrained programming | |
Charging station deployment | |
class imbalance | |
Classification Trees | |
closed queueing networks | |
clustering | |
coherent risk measure | |
column generation | |
Combinatorial & Submodular Optimization | |
Combinatorial Algorithms | |
combinatorial auction | |
combinatorial optimization | |
Communication Complexity | |
Communication compression | |
competitive ratio | |
Complementarity constraints | |
complexity bound | |
Composite optimization | |
Compressed Communications | |
computational optimization | |
Computational social choice | |
Conditional Value at Risk | |
Condorcet Criterion | |
Conic Integer Programming | |
Conic optimization | |
Conjugate gradient | |
conjugate gradient methods | |
Connected vehicle technology | |
consistency | |
constrained convex optimization | |
Constrained Optimization | |
constraint programming | |
constraint sampling | |
Contextual decision-making | |
contextual information | |
Contextual stochastic optimization | |
Contingency modality activation | |
Continuous features | |
continuous greedy | |
Continuous location problems | |
continuous optimization | |
Contraflow | |
Convergence | |
Convergence rate | |
convergence rates | |
Convex hull | |
Convex Integer Program | |
convex optimization | |
convex quadratic optimization | |
convex relaxation | |
convex underestimation | |
Convexification | |
Convexity | |
coordinate descent | |
copositive programming | |
Copula-based Wasserstein Ambiguity | |
Covering Tour Problem | |
COVID-19 | |
curse of dimensionality | |
Cut-generating linear programs | |
Cutting plane | |
cutting planes | |
Cutting-plane | |
CVaR | |
D | |
DARTS | |
Data classification | |
Data Science | |
Data Summarization | |
data-driven | |
Data-Driven Decisions | |
data-driven optimization | |
DC approximation | |
Decentralization | |
Decentralized algorithm | |
Decentralized Consensus | |
Decentralized Optimization | |
Decision Diagrams | |
decision rules | |
decision-dependent information discovery | |
Decomposition | |
Decomposition algorithm | |
decomposition method | |
decomposition methods | |
deep learning | |
Deep Reinforcement Learning | |
Defender-attacker-defender models | |
delayed (sub)gradient | |
delivery planning | |
demand learning | |
Demand uncertainty | |
derivative-free optimization | |
Descent direction | |
diagonal dominance | |
difference-of-convex program | |
differential privacy | |
diffusion methods | |
Directional stationarity | |
Disaster | |
Disaster relief logistics | |
Discrete Optimization | |
discrete-time nonlinear control | |
Disjoint bilinear programming | |
Disjunctive Constraints | |
Disjunctive programming | |
distributed optimization | |
distributed parallelization | |
distribution shift | |
Distributionally Favorable Optimization | |
Distributionally optimistic optimization | |
Distributionally risk-receptive | |
Distributionally Robust | |
Distributionally Robust Optimization | |
districting | |
Diverse Near-Optimal Solutions | |
Diversity | |
DR-Submodular Functions | |
DR-submodularity | |
Droop Control | |
Dual Decomposition | |
dual dynamic programming | |
Duality | |
dynamic flow | |
dynamic programming | |
E | |
early termination | |
Ecommerce | |
Economic risk in agriculture | |
Edge-based Districting | |
effective scenarios | |
Elections Infrastructure | |
Elective Surgeries | |
electric vehicles | |
Emergency response | |
empirical process theory | |
End-to-end learning | |
endogenous uncertainty | |
Energy Management | |
Energy storage price arbitrage | |
engineering design | |
Environmental impact of agriculture | |
Estimate then optimize | |
Euclidean Jordan Algebra | |
evacuation planning | |
exact algorithm | |
exact efficiency guarantees | |
Exact mathematical programming | |
expected improvement | |
Experimental Design | |
Exponential conic program | |
express delivery | |
extragradient method | |
Extrapolation | |
extreme events | |
extreme points | |
F | |
facial reduction | |
Facility location | |
factorization of matrices | |
fairness | |
Fathoming | |
Feature selection | |
Federated Learning | |
Federated Optimization | |
feedback linearization | |
Finite Adaptability | |
Finite Sum | |
Finite-sum composition | |
first-order algorithm | |
first-order method | |
first-order stationary points | |
fixed-parameter tractable | |
Food banks | |
Function approximation | |
G | |
Game Theory | |
Gaussian Mixture | |
General ambiguity set | |
General Noise Model | |
generalization | |
generalized Gauss-Newton | |
gradient descent | |
Graph Neural Networks | |
Graphical model | |
Group sparsity | |
H | |
Healthcare application | |
Healthcare Capacity Management | |
Healthcare Waste | |
Hessian matrix estimation | |
Heterogeneous data | |
heuristics | |
high probability | |
high-dimensional | |
Humanitarian logistics | |
hurricanes | |
Hybrid method | |
hydrothermal energy system planning | |
I | |
Indicator variables | |
inertial acceleration | |
infinite-dimensional optimization | |
Information Measures | |
integer nonlinear optimization | |
integer optimization | |
Integer Program | |
integer programming | |
integer programming game | |
Integer recourse | |
Integrality gap | |
interdependent infrastructures | |
interpolation | |
interpretable machine learning | |
Interpretable Policies | |
inventory control | |
Inventory management | |
iterate-by-iterate prediction | |
iterative algorithms | |
J | |
Job-Shop Scheduling | |
joint chance-constraints | |
K | |
Katyusha | |
Kendall tau distance | |
kernel ridge regression | |
Knapsack Problem | |
L | |
Lagrangian dual | |
Lagrangian Relaxation | |
Large Deviation Theory | |
large deviations theory | |
large-scale optimization | |
large-scale vehicle routing | |
last-mile logistics | |
leave-one-out analysis | |
Line losses | |
line search | |
Linear Convergence | |
Linear Decision Rules | |
linear interpolation | |
linear optimization | |
linear programming | |
linear regularity | |
Linearization | |
local linear convergence | |
local search | |
local solutions | |
Location Analysis | |
Logarithmic Homogeneity | |
Logic Cuts | |
Lot-sizing | |
Low-rank modifications | |
Low-rank optimization | |
lower bounds | |
LP rounding | |
M | |
Machine Learning | |
Maintenance Optimization | |
maintenance scheduling | |
manifold optimization | |
Markov decision process | |
Markov decision processes | |
Matheuristic | |
Matrix Completion | |
matrix factorization | |
Matrix factorizations | |
Matrix perspective relaxation | |
Max Cut | |
Max-Cut | |
maximum-entropy sampling | |
Mechanism design | |
metric subregularity | |
Microgrid | |
Microgrids | |
min-max optimization | |
Minimum Biclique Cover Problem | |
Minimum-Cost Circulation | |
MINLP | |
MISDP | |
Misinformation management | |
Mixed autonomy traffic | |
mixed integer linear optimization | |
Mixed Integer Optimization | |
mixed integer optimization models | |
Mixed Integer Programming | |
Mixed Integer Programs | |
Mixed-integer | |
Mixed-Integer Convex Programming Representability | |
Mixed-Integer Linear Programming | |
mixed-integer nonlinear optimization | |
mixed-integer nonlinear programming | |
Mixed-Integer Programming | |
Mixed-integer programs | |
Mixed-integer quadratic optimization | |
Mobile facility | |
mobile facility location | |
Model Parallelism | |
model-based optimization methods | |
model-predictive control | |
Monotone inclusion Problems | |
Monotone Variational Inequality | |
Moreau envelope | |
Moreau envelopes | |
motion planning | |
Multi-Agent Systems | |
multi-armed bandit | |
Multi-Criteria Decision Making | |
Multi-stage | |
Multi-Stage Stochastic Optimization | |
Multi-stage stochastic programming | |
multicriteria optimization | |
Multidimensional Knapsack Problem | |
Multilinear Uncertainty | |
Multimodal mobility systems | |
multimodal transit systems | |
multinomial logit choice model | |
multiobjective optimization | |
Multiplicative Gradient Method | |
multistage convex optimization | |
Multistage stochastic integer programming | |
N | |
navigation | |
Near-Optimal Solutions | |
network design | |
Network design and pricing problem | |
network flow optimization | |
network interdiction | |
Network Interdiction Games | |
Network optimization | |
neural collapse | |
Neural Networks | |
Node Selection | |
non-adaptive algorithms | |
Non-Dominated Sorting Genetic II Algorithm | |
Non-Intersecting | |
non-linear combinatorial optimization | |
Non-Lipschitz | |
Non-Smooth Optimization | |
nonconvex | |
nonconvex market | |
nonconvex optimization | |
Nonconvex regularization | |
nonconvex-nonconcave | |
nonlinear least squares | |
nonlinear optimization | |
nonlinear programming | |
nonsmooth optimization | |
novel applications | |
Nuclear Power Plants | |
O | |
On-demand shuttles | |
online algorithm | |
online knapsack problem | |
Online Matching | |
online optimization | |
online selection | |
Operations Management | |
Operator Convexity | |
optimal binary classification trees | |
optimal convergence rate | |
Optimal decision tree | |
optimal fuel strategies | |
Optimal power flow | |
Optimal Transport | |
optimality-based bound tightening | |
Optimistic | |
Optimization | |
optimization of noisy functions | |
Optimization software | |
optimization-based bound tightening | |
options pricing | |
OR in Natural Resources | |
OR in societal problem analysis | |
order fulfillment | |
Outer approximation | |
overparameterization | |
overparametrization | |
P | |
Panel Data | |
Parameterized Deterministic Lookahead | |
Parametric linear complementarity problem | |
parametric optimization | |
Partially Ordered Sets | |
Particle Swarm Optimization | |
Partition-based methods | |
PDHG | |
Performance Bounds | |
Personalized decision making | |
Perspective function | |
Pessimistic Bilevel Program | |
Pharmaceutical supply chain management | |
Phase Transitions | |
phi-divergence | |
piecewise concave costs | |
Piecewise decision rules | |
political redistricting | |
Polyhedral approximation | |
polyhedral study | |
Portfolio optimization | |
Power systems | |
Power systems operations | |
preprocessing | |
pricing | |
primal-dual algorithms | |
primal-dual method | |
Principal component analysis | |
problem instance data | |
problem instance description | |
problem instance interchange | |
Programming | |
Progressive hedging algorithm | |
Projected Alternating Maximization | |
Projection Cuts | |
prophet inequalities | |
Prosumers | |
Prox-linear | |
Proximal point algorithm | |
Proximity results | |
Public transit | |
Q | |
QAOA | |
Quadratic | |
quadratic assignment problem | |
quadratic convex optimization | |
quadratic programming | |
Quadratic programs | |
Quadratic Unconstrained Binary Optimization | |
Quadratically Constrained Quadratic Programming | |
quantity-contingent auction | |
Quantum | |
Quantum Approximate Optimization Algorithm | |
Quantum Computing | |
quantum key distribution | |
quasi-Newton method | |
QUBO formulations | |
queuing optimization | |
R | |
R package | |
random features | |
random matrix theory | |
Random recourse | |
Random Service Time | |
Random Travel Time | |
Randomized algorithm | |
Randomized block coordinate algorithm | |
rank | |
Rank aggregation | |
real-time optimization | |
recombination | |
redistricting | |
Reformulation Linearization Technique | |
regression | |
regret | |
reinforcement learning | |
relaxation | |
relocation | |
Renewable energy | |
Resilience | |
Resiliency | |
Resource allocation | |
restarts | |
reusable resources | |
Reward-Risk Ratio | |
Ride hailing | |
Ridepooling assignment problem | |
Riemannian optimization | |
Risk-Averse | |
risk-averse optimization | |
RLT | |
robust machine learning | |
robust objective | |
Robust Optimization | |
robust principal component analysis | |
Robust Statistics | |
Robustness | |
Rockafellian | |
Rounding | |
route prediction | |
S | |
Saddle Point Problem | |
sample average approximation | |
Scenario decomposition | |
Scenario Dominance Cuts | |
Scheduling | |
Scheduling and Routing | |
scheduling optimization | |
SDDP | |
Second-order conic program | |
secretary problem | |
Semidefinite optimization | |
semidefinite programming | |
semismooth Newton | |
sensitivity analysis | |
Sensor location | |
Sequential Decisions Under Uncertainty | |
sequential quadratic optimization | |
service systems | |
Set dominance | |
sex trafficking | |
shape constraint | |
sharp growth | |
sharpness | |
Side information | |
simplex approximation | |
simulated annealing | |
simulation optimization | |
simultaneous perturbation stochastic approximation (SPSA) | |
singularity degree | |
small random initialization | |
Small-Signal Stability | |
smoothing | |
Social networks | |
solution paths | |
sparse | |
sparse grid | |
Sparse implementation | |
Sparse machine learning | |
sparse optimization | |
Sparse PCA | |
Sparse SVD | |
Spatial-Temporal Optimization | |
Spectral initialization | |
Spiked Covariance Model | |
split cut | |
SQL | |
stability | |
static policy | |
Statistical ambiguity | |
Statistical Computing | |
Statistical-computational gap | |
Stochastic | |
stochastic (sub)gradient method | |
stochastic algorithms | |
Stochastic approximate cutting plane | |
stochastic approximation | |
Stochastic Dual Dynamic Programming | |
Stochastic dynamic programming | |
Stochastic gradient descent | |
Stochastic Integer Programming | |
Stochastic Job-Shop Scheduling | |
Stochastic network interdiction | |
stochastic optimization | |
Stochastic programming | |
stochastic programs | |
stochastic scheduling | |
Stochastic variational inequality | |
Stratified Experiment | |
Strong convergence | |
strong polynomiality | |
subcontracting | |
subgradient method | |
Submodularity | |
subspace clustering | |
Substitutable Products | |
superlinear convergence | |
Superquantile | |
Supply Chain Debottlenecking | |
surrogate sparsity functions | |
survival function | |
Symmetric Cone | |
Symmetry | |
Synthetic Control | |
T | |
the max k-cut problem | |
tight guarantees | |
top-$k$ list | |
Top-k list aggregation | |
Tractability | |
tradespace analysis | |
transmission line switching | |
Transportation | |
traveling salesman problem | |
Tri-level programming | |
tridiagonal | |
Truncated SVD | |
trust region methods | |
trust-region optimization | |
Two-stage | |
two-stage problem | |
two-stage problems | |
Two-stage robust optimization | |
two-stage stochastic programming | |
U | |
Ultra-high dimensionality | |
uncertain offer acceptance | |
Unit commitment | |
V | |
Valid Inequalities | |
Variable selection | |
Variance reduction | |
Vehicle routing | |
Vehicle sharing systems | |
VIKOR Technique | |
volume | |
Voronoi restart | |
W | |
Wasserstein ambiguity | |
Wasserstein distance | |
Wasserstein distributionally robust optimization | |
Waste Treatment | |
Weak convergence | |
Wilson's Algorithm | |
Wireless sensor networks | |
worst-case complexity | |
Z | |
Z-matrix | |
zeroth-order optimization |