TALK KEYWORD INDEX
This page contains an index consisting of author-provided keywords.
| A | |
| A-optimality | |
| Accelaration | |
| Acceleration | |
| Ackley function | |
| active learning | |
| adaptive algorithm | |
| Adaptive Dose-Finding | |
| Adiabatic Quantum Computing | |
| ADMM | |
| Agricultural products | |
| Algebraic geometry | |
| algorithm | |
| Algorithmic Fairness | |
| Alternating Direction Method of Multipliers | |
| analytics | |
| appointment scheduling | |
| Approximate dynamic programming | |
| approximate linear programming | |
| Approximation | |
| Approximation algorithms | |
| Assortment Planning | |
| asymptote | |
| Asymptotic Analysis | |
| Asymptotic Convergence | |
| B | |
| barriers to discharge | |
| Bayesian | |
| Belief Propagation | |
| Bender's decomposition | |
| Benders | |
| Benders decomposition | |
| Best subset selection | |
| betweenness centrality | |
| Bi-level model | |
| bi-objective | |
| biased stochastic approximation | |
| Big-M Bounds | |
| Bilevel optimization | |
| bilevel programming | |
| bilinear problem | |
| Bimodal service duration | |
| bin packing | |
| Binary Optimization | |
| blind deconvolution | |
| block relocation problem | |
| bounding | |
| Bounds tightening | |
| branch and price | |
| Branch-and-Bound | |
| Branch-and-Bound Algorithm | |
| branch-and-cut | |
| Branch-and-cut algorithm | |
| branch-and-price | |
| Branching | |
| breast cancer screening | |
| breast density information | |
| C | |
| Car-sharing | |
| Casual Inference | |
| causal inference | |
| Chance Constraints | |
| chance-constrained programming | |
| Classification | |
| Cloud computing | |
| color fragmentation | |
| column generation | |
| Column-and-Constraint Generation | |
| Combinatorial constraints | |
| combinatorial multi-armed bandits | |
| combinatorial optimization | |
| Combinatorial Optimization Hardware | |
| combinatorial structure | |
| competitive analysis | |
| competitive ratio | |
| Complexity | |
| Complexity analysis | |
| Composite optimization | |
| Computational Social Choice | |
| concave subcontracting costs | |
| Concentration inequalities | |
| Conditional Gradient | |
| Conditional Value-at-Risk | |
| conic | |
| conic mixed integer rounding | |
| conic optimization | |
| Conic programming | |
| Conjugate Gradient methods | |
| Consistency | |
| Constrained Optimization | |
| Constrained Stochastic Optimization | |
| constraint programming | |
| container | |
| continuous optimization | |
| Control solution | |
| Convergence analysis | |
| convergence rate | |
| Convex approximations | |
| Convex hull | |
| convex optimization | |
| Convex quadratic programs | |
| convex relaxation | |
| Convex-concave minimax optimization | |
| Convexification | |
| Coordinate descent | |
| cost and time buffers | |
| course scheduling | |
| covariates | |
| covering tour | |
| Cross-validation | |
| Cubic binary optimization | |
| cut classification | |
| Cut management | |
| Cut-and-Lift | |
| Cutting plane methods | |
| Cutting Planes | |
| Cutting-Plane Algorithms | |
| cystic fibrosis | |
| D | |
| Data-driven ambiguity set | |
| data-driven optimization | |
| Data-driven prescriptive analytics | |
| Data-driven stochastic programming | |
| data-integrated modeling | |
| Dave Shanno | |
| DDPG | |
| decentralized decisions | |
| Decision diagrams | |
| Decision making | |
| Decision Making under Uncertainty | |
| Decomposition | |
| decomposition algorithms | |
| Deep Learning | |
| demand learning | |
| Derivative-free optimization | |
| Diagonal perturbation | |
| Difference of convex optimization | |
| discharge prediction | |
| Discrete Optimization | |
| Discretization | |
| Disjunctive Cutting Planes | |
| disruption intensity | |
| Distance Function | |
| distributed optimization | |
| distribution network | |
| Distributionally robust | |
| Distributionally robust dynamic optimization | |
| Distributionally robust optimization | |
| Districting | |
| Domain reduction | |
| Downstream Resource Constraints | |
| drone | |
| drone routing | |
| drug shortages | |
| dual threshold | |
| Duality | |
| Dubins’ vehicles | |
| dynamic optimization | |
| dynamic pricing | |
| dynamic programming | |
| dynamic programming applications | |
| Dynamical Systems | |
| E | |
| earned value analysis | |
| effective resistances | |
| electric vehicle sharing | |
| electrical flows | |
| elementary reformulation | |
| Emerald ash borer | |
| empirical risk minimization | |
| end-to-end | |
| endogenous uncertainty | |
| energy systems | |
| entropy | |
| entrywise guarantee | |
| equity | |
| Error Bound Condition | |
| Exactness | |
| F | |
| Facility location | |
| Feasibility | |
| feature engineering | |
| Finance | |
| Finite-sample guarantees | |
| Finite-sum composition | |
| Firefly optimization algorithm | |
| First-Order Methods | |
| fixed-charge generalized network | |
| fixed-charge generalized transshipment network heuristic | |
| Fixed-point theorems | |
| fixed-wing drones | |
| flow machine learning | |
| Flow shop scheduling | |
| folded concave penalty | |
| Forecasting | |
| formulation | |
| Formulations | |
| Functional Constraints | |
| G | |
| generalizability of neural network | |
| Generalized eigenvalue | |
| Genetic Algorithms | |
| Genetic testing | |
| Geomagnetic disturbances | |
| Global optimization | |
| Global trade | |
| gradient descent | |
| graph clustering | |
| Graph contraction | |
| Graph Embedding | |
| graph mining | |
| Graph minors | |
| graph partitioning | |
| Greedy heuristic | |
| Groundwater prediction | |
| Group Efficacy | |
| H | |
| health care | |
| healthcare | |
| heuristic | |
| Heuristics | |
| Hidden Markov models | |
| Hierarchical method | |
| High performance computing | |
| Hilbert space | |
| Huge Scale | |
| Human Trafficking | |
| Humanitarian Logistics | |
| humanitarian relief | |
| humanitarian supply chain | |
| hydropower | |
| Hypergraphs | |
| Hyperparameter optimization | |
| I | |
| illposedness | |
| Imbalanced learning | |
| implicit bias | |
| implicit regularization | |
| Independent Set | |
| Indicator variables | |
| inexact data | |
| influence maximization | |
| Information relaxation | |
| infrastructure protection | |
| integer | |
| Integer Column Generation | |
| Integer Linear Programming | |
| Integer programing | |
| Integer Programming | |
| Inter-optimal polyhedron | |
| Interactions | |
| Interative methods | |
| Interdependent Infrastructures | |
| interdiction | |
| Interdiction games | |
| Interference models | |
| interior point | |
| Interior point method | |
| Interior Point Methods | |
| Interior-point methods | |
| Internal to External set up | |
| Interpretable policy | |
| interval analysis | |
| interval linear programming | |
| Interval linear system | |
| inventory | |
| Inventory management | |
| Inverse optimization | |
| Inverse problem | |
| Ising Model | |
| Iterative Combinatorial Auctions | |
| Iterative method | |
| J | |
| Job sequencing and scheduling | |
| Job shop scheduling | |
| JuMP | |
| K | |
| k-means clustering | |
| Katyusha | |
| Katz centrality | |
| kidney exchange | |
| knapsack problem | |
| L | |
| L1-norm line fitting | |
| L1-norm principal component analysis | |
| L1-norm subspace fitting | |
| labeling algorithm | |
| Lagrange function | |
| Lagrangian relaxation | |
| Land use optimization | |
| Landscape | |
| large deviations theory | |
| Large Neighborhood Search | |
| Large-scale optimization | |
| LASSO problems | |
| Last-mile | |
| Last-mile logistics | |
| latently decision-dependent uncertainty | |
| Lazy Constraints | |
| Learning | |
| leave-one-out | |
| leave-one-out analysis | |
| Level Set methods | |
| Lifting | |
| linear conic optimization | |
| linear convergence | |
| Linear Programming | |
| Linearizable | |
| Linearization | |
| local minima | |
| Local Search | |
| local search algorithm | |
| Locality sensitive hashing | |
| low rank | |
| Low-rank matrix recovery | |
| lower bound | |
| M | |
| M-natural-convexity | |
| machine cell formation | |
| machine learning | |
| Makespan | |
| Market Baskets | |
| Markov decision process | |
| mathematical modeling | |
| matrix completion | |
| matrix decomposition | |
| maximum entropy sampling problem | |
| MCP | |
| meta learning | |
| Min-max optimization | |
| MINLP | |
| mirror descent | |
| Mixed Integer Linear Program (MILP) | |
| mixed integer optimization | |
| mixed integer program | |
| Mixed Integer Programming | |
| Mixed integer quadratic programs | |
| Mixed integer quadratically constrained programming | |
| Mixed-integer conic quadratic optimization | |
| Mixed-Integer Convex Optimization | |
| Mixed-Integer Linear Programming | |
| Mixed-integer non-linear and linear | |
| Mixed-integer Nonlinear Programming | |
| Mixed-integer optimization | |
| Mixed-integer programming | |
| Mixed-integer quadratic optimization | |
| Mixed-integer recourse | |
| Mixing | |
| Mixing inequalities | |
| Mixing sets | |
| model-agnostic meta-learning | |
| model-free | |
| multi-capacitated lot-sizing | |
| Multi-scale Capacity Expansion | |
| Multi-stage parallel machines | |
| Multi-stage stochastic mixed integer programming | |
| multi-stage stochastic program | |
| multi-stage stochastic programming | |
| multi-step methods | |
| Multilevel Algorithms | |
| Multilinear functions | |
| Multinomial Logit Choice Model | |
| multinomial logit model | |
| multiobjective discrete optimization | |
| Multiobjective optimization | |
| Multiple Optimal Solutions | |
| multistage | |
| Multistage stochastic linear programs· | |
| multistage stochastic programming | |
| multistart optimization | |
| N | |
| N-1 contingency | |
| Natural Gas Pipelines | |
| Near-optimal | |
| Nearest neighbors | |
| Nesting Program | |
| network alignment | |
| network centrality | |
| Network Design | |
| Network interdiction | |
| network models | |
| network robustness | |
| Network routing under uncertain link failures | |
| network-based model | |
| network-simplex-based heuristic | |
| Networks | |
| Neural Network Pruning | |
| Neural networks | |
| Neuron Stability | |
| newborn screening | |
| Newton Method | |
| Noisy binary search | |
| non-convex | |
| Non-convex optimization | |
| non-stationary online optimization | |
| Nonconvex | |
| nonconvex optimization | |
| Nonconvex optimization with nonlinear equality constraints | |
| Nonconvex Stochastic Optimization | |
| Nonconvex-concave | |
| nonincreasing optimal solution | |
| Nonlinear Optimization | |
| Nonlinear Programming | |
| nonlinear stochastic model | |
| NonLipschitz | |
| Nonsmooth optimization | |
| Nonsymmetric cones | |
| Nurse staffing | |
| Nutrient reduction | |
| O | |
| observational data | |
| ODEs | |
| One-step Look-ahead Policy | |
| Online algorithms | |
| online and approximation algorithms | |
| Online convex optimization | |
| online hiring | |
| Online learning | |
| online optimization | |
| open source software | |
| operating room scheduling | |
| OPF | |
| optimal algorithms | |
| Optimal Decision Tree | |
| Optimal power | |
| Optimal Scheduling | |
| optimal transport | |
| optimization | |
| Optimization on manifolds | |
| Optimization under uncertainty | |
| OR for Social Good | |
| OR in health services | |
| order statistics | |
| orienteering | |
| Outer Approximation | |
| Outlier robust | |
| over-parameterization | |
| P | |
| panel design | |
| parallel computing | |
| Parameter fitting | |
| Parametric Optimization | |
| partial convex hull | |
| partially observable | |
| Personalized Day Tour | |
| Personalized Medicine | |
| Perspective formulation | |
| perspective reformulation | |
| pharmaceutical | |
| Phase transition | |
| piecewise concave production cost | |
| polyhedral study | |
| Polyhedral Theory | |
| Polymatroid inequalities | |
| Polynomial Optimization | |
| polytope | |
| positive-valued function | |
| Posterior Sampling | |
| Power Grid | |
| power method | |
| Power Systems | |
| Preconditioning | |
| prediction | |
| Predictive modeling | |
| predictive-and-prescriptive analytics | |
| preference elicitation | |
| prescriptive analysis | |
| price of equity | |
| Primal-Dual Hybrid Gradient | |
| principal-agent framework | |
| product transition | |
| Product Trasitions | |
| production planning | |
| programming | |
| project buffers | |
| project control | |
| Project crashing | |
| project management | |
| Projection-Free | |
| Protein-Protein Interaction Networks | |
| Proximal augmented Lagrangian | |
| proximal operator splitting | |
| Proximal point algorithm | |
| pseudo gradient | |
| Q | |
| Q-learning | |
| QCQP | |
| quadratic assignment problem | |
| Quadratic optimization | |
| Quadratic Unconstrained Binary Optimization | |
| Quadratically constrained quadratic programming | |
| quantile bounds | |
| Quantum Annealers | |
| Quantum Annealing | |
| quantum approximate optimization | |
| quasi-Newton Methods | |
| R | |
| Random features | |
| Random Fourier features | |
| random no-shows | |
| random-walk betweenness centrality | |
| Randomized rounding | |
| Rank one | |
| Ranking Aggregation | |
| Ranking-based Choice Model | |
| rare events | |
| recommendations | |
| recommender system | |
| recovery | |
| Rectifier Linear Unit | |
| Regression | |
| regularized cutting plane methods | |
| reinforcement learning | |
| relaxation | |
| Renewable energy | |
| Resource allocation | |
| Riemannian subgradient method | |
| risk | |
| risk-averse decision making | |
| Risk-aversion | |
| RLT | |
| Robust MDP | |
| robust optimization | |
| robust principal component analysis | |
| robustness to unobservables | |
| Rolling-horizon procedure | |
| S | |
| S-convexity | |
| Saddle-point problems | |
| sample average approximation | |
| Sample Complexity | |
| sampling algorithm | |
| SCAD | |
| scenario decomposition | |
| Scenario reduction | |
| scenario tree decomposition | |
| scenario-based cuts | |
| SDDP | |
| SDDP algorithm | |
| SDDP.jl | |
| Second order cone programming | |
| Second-order cone optimization | |
| secretary problem | |
| Semiconductor Manufacturing | |
| Semidefinite optimization | |
| Semidefinite program | |
| semidefinite programming | |
| semismooth Newton method | |
| Sensitivity | |
| sensitivity analysis | |
| Sequential optimization | |
| sequential sampling | |
| set packing | |
| set-covering problem | |
| simulation-optimization | |
| Sliding | |
| Software | |
| solver | |
| solving quadratic systems of equations | |
| spanning trees | |
| Sparse PCA | |
| sparse regression | |
| Sparsity | |
| Spatial branch-and-cut | |
| spatial statistics | |
| Spatio-temporal random fields | |
| Spectral initialization | |
| stable set | |
| Star Degree Centrality | |
| steel slab | |
| Stefiel manifold | |
| Stein’s identity | |
| Stochastic approximation | |
| stochastic decomposition | |
| stochastic disruption | |
| Stochastic disruptions | |
| stochastic dual dynamic programming | |
| Stochastic Dynamic Dual Programming | |
| stochastic gradient descent | |
| Stochastic Gradient Methods | |
| stochastic integer programming | |
| stochastic mirror descent | |
| Stochastic mixed-integer linear program | |
| Stochastic Modeling | |
| Stochastic optimal power flow | |
| stochastic optimization | |
| Stochastic optimization· | |
| stochastic programmin | |
| stochastic programming | |
| strict saddle | |
| Structured subproblem | |
| Subadditive Duality | |
| Subgradient Optimization | |
| Submodular function | |
| submodular optimization | |
| Substitutability | |
| Sum of Squares | |
| Sum of Squares Optimization | |
| superlinear convergence | |
| Supply chains | |
| Support vector machine | |
| Support Vector Machines | |
| Surgery Scheduling | |
| Surrogate models | |
| sustainable transportation | |
| Symmetry | |
| T | |
| Tariff rate quotas | |
| teaching assignment | |
| Team formation | |
| Thompson sampling | |
| Tolerance solution | |
| Total flow time | |
| Tractability | |
| transfer learning | |
| Transmission Expansion Planning | |
| Transmission grid operation | |
| Transmission Switching | |
| Trust-Region Methods | |
| Tuberculosis infection | |
| Tuberculosis screening | |
| two-stage distributionally robust conic mixed integer program | |
| two-stage problems | |
| two-stage stochastic programming | |
| U | |
| UAV | |
| ultrasound/MRI | |
| Uncertainty | |
| Uncertainty Quantification | |
| uncertainty set | |
| unconstrained optimization | |
| Unit Commitment | |
| Utility Theory | |
| V | |
| vaccine allocation | |
| Valid inequalities | |
| valid inequality | |
| value of supplemental testing | |
| VAR | |
| Variable selection | |
| variance reduction | |
| Variational inequalities | |
| Variational regularization | |
| vehicle routing | |
| vehicle-to-grid (V2G) | |
| Vertex Solution | |
| vocabulary compression | |
| volume | |
| W | |
| Warm Starts | |
| Wasserstein barycenters | |
| Wasserstein metric | |
| weak infeasibility | |
| Weakly convex | |
| Wind farm | |
| Wind power output | |
| Wireless network jamming | |
| worst-case efficiency estimates | |
| Z | |
| Zero-one Mixed Integer Programming | |
| Zeroth-order methods | |