TALK KEYWORD INDEX
This page contains an index consisting of author-provided keywords.
| A | |
| Academic rankings | |
| accelerated algorithms | |
| accelerated gradient descent | |
| acceleration | |
| Access control | |
| actor-critic | |
| Adaptive | |
| Adaptive Algorithms | |
| adaptive experimentation | |
| adaptive methods | |
| adaptive optimization | |
| Adaptive Partitioning | |
| Adaptive robust optimization | |
| adaptive sampling | |
| adaptive step size | |
| Adaptivity | |
| Adaptivity Gap | |
| Adaptivity gaps | |
| Adjustable risk | |
| adjustable robust optimization | |
| ADMM | |
| Advanced Available-to-Promise (AATP) | |
| adversarial Markov Decision Processes | |
| Adversarial Robust | |
| Adversarial robust learning | |
| Adversarial robustness | |
| affine hull | |
| affine policy | |
| Agent Agnostic Mechanisms | |
| Aggregated limited-memory | |
| AI for Optimization | |
| airline | |
| Algorithm Stability | |
| Algorithm Unrolling | |
| Algorithmic Fairness | |
| Algorithmic game theory | |
| Algorithmic pricing | |
| Algorithms | |
| algorithms with predictions | |
| almost-sure convergence | |
| Alternating Current Optimal Power Flow Problem | |
| alternating direction method of multipliers (ADMM) | |
| alternating sampling framework | |
| always-active constraints | |
| AMPL | |
| Analog Computing | |
| Analysis of algorithms: Data structures | |
| Analysis of algorithms: Suboptimal algorithms | |
| Ant colony optimization (ACO) | |
| API | |
| application | |
| applied category theory | |
| approximate linear programming | |
| Approximate Subgradient | |
| approximation algorithm | |
| Approximation algorithms | |
| Approximation Schemes | |
| Assortment Optimization | |
| asymptotic bias | |
| Asymptotic Normality | |
| Auction Algorithms | |
| Augmented Lagrangian | |
| augmented Lagrangian methods | |
| Autoencoder | |
| Automated scientific discovery | |
| automatic differentiation | |
| autonomous experimentation | |
| autonomy | |
| Autoregressive Stochastic Process | |
| B | |
| b-hull | |
| b-matching | |
| backtracking | |
| Balls and Bins | |
| BAM | |
| bandit | |
| Bandits | |
| barrier functions | |
| Basic Algorithm | |
| BASS model | |
| Bayesian Additive Regression Trees | |
| Bayesian inference | |
| Bayesian optimization | |
| Bellman equation | |
| benchmarking | |
| Bender's Decomposition | |
| Benders decomposition | |
| Benjamini Hochberg | |
| Best Arm Identification | |
| bi-level optimization | |
| Biclique Covers | |
| Bidirectional Search | |
| Big data | |
| Bilevel Optimization | |
| Bilinear Assignment Problem | |
| Bilinear optimization | |
| bilinear program | |
| Bin Packing | |
| Binary Quadratic Problems | |
| bisubmodular polyhedra | |
| Black-box optimization | |
| Blackbox Optimization | |
| Blind Source Separation | |
| Block-coordinate Methods | |
| Blockchain | |
| Boosted DCA | |
| Boosted Difference of Convex Functions Algorithm | |
| Boscia | |
| Bound propagation | |
| branch and bound | |
| branch and price | |
| branch-and-bound | |
| Branch-and-cut solvers | |
| Branch-and-Price | |
| Branching Method | |
| branching on general disjunctions | |
| Bregman primal--dual hybrid gradient method (PDHG) | |
| Brunn-Minkowski theory | |
| budget constraint | |
| budgeted uncertainty | |
| Burer-Monteiro decomposition | |
| Burer-Monteiro method | |
| Bures–Wasserstein Space | |
| C | |
| C# | |
| C++ | |
| calibration | |
| Callbacks | |
| Capacity expansion | |
| causal inference | |
| Causal Transport | |
| Central path | |
| Chambolle-Pock | |
| Chambolle-Pock method | |
| Chance constrained optimization | |
| Chance Constraint | |
| chance constraints | |
| Chance-Constrained Optimization | |
| Chance-Constrained Problem | |
| Chance-constrained programming | |
| Chvátal-Gomory rank-1 cuts | |
| Circuit Cutting | |
| Classification Theory | |
| cloud computing | |
| cloud supply chain | |
| Clustering | |
| co-design | |
| Co-occurrence graph | |
| Coefficient of Prescriptiveness | |
| column generation | |
| Column W property M matrix | |
| Combinatorial Disjunctive Constraints | |
| combinatorial optimization | |
| Combined heat and power systems | |
| Communication | |
| communication complexity | |
| Communication Compression | |
| Competitive analysis | |
| complexity | |
| complexity analysis | |
| complexity bound | |
| complexity guarantees | |
| Compositional Optimization | |
| compositionality | |
| compressive sensing | |
| compromise decisions | |
| Computation | |
| computational learning theory | |
| computational noise | |
| computationally expensive optimization | |
| computationally tractable | |
| computed tomography | |
| Computer simulation | |
| Concave utility | |
| condition number | |
| conditional generative model | |
| Conditional gradient method | |
| conditional value-at-risk | |
| Conditional-gradient method | |
| cone programming | |
| Confidence Bounds | |
| Conflict Graph | |
| Conic Linear Optimization | |
| Conic mixed-binary sets | |
| conic optimization | |
| conic programming | |
| conic reformulation | |
| conjugate function | |
| conjugate gradient method | |
| constant stepsize | |
| Constrained Action Space | |
| constrained convex optimization | |
| constrained Markov decision processes | |
| constrained optimal control | |
| constrained optimization | |
| constrained policy optimization | |
| Constraint Generation | |
| contact optimization | |
| contagion analytics | |
| content creator incentives | |
| Contention Resolution | |
| Contextual bandits | |
| contextual optimization | |
| Contextual stochastic optimization | |
| Continuous approaches to discrete optimization | |
| continuous optimization | |
| continuous-time analysis | |
| Contrastive Learning | |
| control | |
| Controlled Averaging | |
| Convergence | |
| convergence analysis | |
| Convergence Guarantees | |
| Convergence lower bound | |
| Convergence rate analysis | |
| Convex | |
| Convex analysis | |
| Convex bodies | |
| convex cooperative game | |
| Convex hull | |
| convex hull pricing | |
| Convex optimization | |
| convex quadratic programs | |
| Convex relaxation | |
| convexification | |
| convexity detection | |
| cooling | |
| Coordinate Descent | |
| Copositive program | |
| Copositive programming | |
| Correction term | |
| Counterfactual decisions | |
| coupled constraints | |
| Covariate Uncertainty | |
| Cover inequalities | |
| COVID-19 | |
| Cross-docking | |
| Cross-validation | |
| cryptography | |
| Cubic binary optimization | |
| cubic regularization of Newton | |
| Cutting plane algorithm | |
| Cutting plane method | |
| Cutting planes | |
| Cutting set method | |
| Cutting-planes | |
| Cycle Partitioning | |
| D | |
| D-optimality | |
| Dantzig-Wolfe decomposition | |
| Data Classification | |
| Data Envelopment Analysis | |
| Data Heterogeneity | |
| Data sharing | |
| data visualization | |
| data-driven analysis | |
| Data-driven learning | |
| data-driven methods | |
| data-driven optimization | |
| Data-driven policies | |
| Data-driven sequential decision making | |
| Data-driven stochastic programming | |
| data-driven uncertainty set | |
| Data-quality | |
| databases | |
| DC power flow | |
| DC Programming | |
| DCA | |
| Decentralized and Networked Gradient Algorithm | |
| decentralized averaging | |
| Decentralized optimization | |
| Decision Diagrams | |
| decision rules | |
| Decision Tree | |
| Decision Tree Algorithm | |
| decision trees | |
| Decision-dependent uncertainty | |
| Decision-focused learning | |
| Decision-Making and Learning of Agents | |
| Decision-making with predictions | |
| decomposition | |
| Decomposition algorithms | |
| Deep equilibrium models | |
| deep learning | |
| Deep learning theory | |
| Deep Neural Networks | |
| Degree theory | |
| DEQ | |
| derivative-based optimization | |
| derivative-free optimization | |
| Determinant | |
| Diagnostic tools | |
| diagonal linear networks | |
| difference of convex (DC) | |
| Difference of Convex Functions Algorithm | |
| difference-of-convex optimization | |
| differentiable optimization | |
| differentiable programming | |
| Differential equation | |
| differential evolution | |
| Differential Privacy | |
| Diffusion models | |
| dimension insensitive | |
| Dimension reduction | |
| dimensionality | |
| Direct-search algorithms | |
| directed max cut | |
| directional stationary solution | |
| Discontinuous Galerkin | |
| discrete | |
| Discrete choice model | |
| Discrete optimization | |
| discrete-time Markov chains | |
| Disjunctive constraints | |
| Disjunctive cuts | |
| Disjunctive programming | |
| distributed optimization | |
| Distributed Quantum Computing | |
| Distributed system | |
| Distribution Shift | |
| distribution-free algorithms | |
| distributional convergence | |
| Distributional robustness | |
| Distributional-robustness | |
| Distributionally Robust | |
| Distributionally Robust Optimization | |
| Diversity | |
| docker | |
| Domain adaptation | |
| Doubly-nonnegative relaxation | |
| dual certificates for IP | |
| Dual Decomposition | |
| Dual degeneracy | |
| Duality | |
| Duality Theory | |
| dynamic constraints | |
| Dynamic Optimal Transport | |
| dynamic programming | |
| dynamic programming principle | |
| dynamic route choice models | |
| Dynamical systems | |
| E | |
| E-Optimal design | |
| Early stopping | |
| edge-based districting | |
| edge-based p-median | |
| Edge-concave relaxation | |
| efficiency | |
| Efficient formulations | |
| Eigenvalue optimization | |
| Eisenberg-Noe model | |
| Electric vehicles | |
| electricity markets | |
| electrified transportation | |
| Empirical risk minimization | |
| Encryption | |
| end-to-end learning | |
| Endogenous uncertainty | |
| Energy | |
| Energy Markets | |
| Entanglement | |
| entropy regularization | |
| epidemic modeling | |
| Epidemics | |
| Epigraph | |
| equilibria | |
| Error Bound Analysis | |
| error ratio | |
| error-bound condition | |
| Euclidean distance matrices | |
| Euclidean Max-Sum Diversity Problems | |
| Evolutionary game theory | |
| evolutionary resistance | |
| Exact Algorithm | |
| exact algorithms | |
| exact linear algebra | |
| Exact penalty functions | |
| Expansion planning | |
| expected value | |
| Experimental Design | |
| exploration | |
| Extended Representations | |
| Extra Gradient | |
| extragradient-based minimax optimization | |
| extreme value theory | |
| F | |
| facial reduction | |
| facility location | |
| Fairness | |
| fairness in AI | |
| false active index | |
| False Detection Rate | |
| feasibility | |
| feasible method | |
| feature learning | |
| Federated Bilevel Optimization | |
| Federated Learning | |
| filters trust-region | |
| Financial Ratios | |
| Finite element | |
| finite sum minimization | |
| Finite-sum Problem | |
| finite-time consensus | |
| firer-order methods | |
| first order algorithms | |
| first order methods | |
| first-order method | |
| first-order methods | |
| First-order stochastic approximation | |
| Fixed Charge Network Flow | |
| flexible resource allocation | |
| Fokker-Planck | |
| FOM | |
| Food Losses | |
| Forward-Backward Algorithm | |
| Fractal-Fractional | |
| Fractional constraint | |
| frame interpolation | |
| Frank-Wolfe | |
| free spectrahedra | |
| freight logistics | |
| Fully polynomial time approximation scheme | |
| Function-constrained optimization | |
| Fundraising | |
| G | |
| GAGAN Algorithm(GA) | |
| Game Theory | |
| gas pipeline network | |
| gas-electric integrated system | |
| Gauges | |
| Gaussian process | |
| Gaussian Variational Inference | |
| Generalization | |
| generalization guarantees | |
| Generalized convexity | |
| Generalized eigenvalue | |
| Generalized quasiconvexity | |
| Generation Expansion Planning | |
| generative adversarial network | |
| generative model | |
| genetic algorithm | |
| gentrification | |
| Geodesic Optimization | |
| global convergence | |
| Global optimization | |
| Global search | |
| Gomory corner relaxation | |
| Gomory group relaxation | |
| Gomory mixed integer cuts | |
| GPU | |
| gradient descent | |
| gradient descent ascent dynamics | |
| gradient norm minimization | |
| Graph Centrality | |
| graph neural networks | |
| graph partitioning | |
| graph scattering | |
| Graph Smoothness | |
| Graph theory | |
| graphics processing unit | |
| graphons | |
| Graver bases | |
| ground state | |
| group parity | |
| Grover's algorithm | |
| Grunwald Letnikov Finite Difference | |
| H | |
| Hamilton-Jacobi-Bellman equation | |
| Hamiltonian simulation | |
| Hausdorff convergence | |
| Health Care Disparities | |
| Health Care Quality | |
| Healthcare | |
| healthcare analytics | |
| heavy-tailed-ness | |
| Herd-immunity | |
| heuristic | |
| Heuristics | |
| Hicksian demand | |
| Hidden Convexity | |
| high dimensional | |
| high dimensional asymptotics | |
| high dimensionality | |
| high probability | |
| High-dimension | |
| high-dimensional competition | |
| high-dimensional sampling | |
| High-dimensional statistics | |
| high-probability guarantees | |
| Higher-order Methods | |
| Hilbert bases | |
| hindsight optimization | |
| Hoffman constants | |
| homelessness | |
| Hurricane relief logistics | |
| hybrid control | |
| hybrid limit cycles | |
| hypergradient estimation | |
| hypomonotonicity | |
| Hypothesis Testing | |
| I | |
| Identical-interest Markov games | |
| implicit constraints | |
| implicit equality | |
| implimentation improvement | |
| importance sampling | |
| in-context learning | |
| independence number | |
| Independent Branching | |
| Indicator variables | |
| Inertial extrapolation | |
| Inexact Function | |
| Inexact Gradient | |
| Inexact Oracle | |
| information basis | |
| Integer and Disjunctive Optimization | |
| Integer Linear Programming | |
| integer optimization | |
| Integer Points | |
| integer program | |
| integer programming | |
| Interdependent infrastructure networks | |
| Interdiction | |
| interior methods | |
| Interior point | |
| interior point method | |
| Interior Point Method (IPM) | |
| Interior Point Methods | |
| interior-point method | |
| Intermediate Public Transport | |
| interpretability | |
| intrusion detection | |
| inverse | |
| inverse optimization | |
| inverse problems | |
| irrational parameters | |
| ising model | |
| Ising Solvers | |
| Iteration Complexity | |
| iterative methods | |
| Iterative Refinement | |
| J | |
| Jensen's Inequality | |
| Job Scheduling | |
| K | |
| k shortest paths | |
| KKT conditions | |
| KKT system | |
| KL property | |
| Knapsack | |
| Knapsack problem | |
| Kronecker product | |
| L | |
| Lagrange multipliers | |
| Lagrange Relaxation | |
| Lagrangian duality | |
| Lagrangian optimization | |
| Lagrangian relaxation | |
| Lagrangian underestimate | |
| Language Model | |
| Large language model | |
| large scale optimization | |
| Large-Scale | |
| Large-scale optimization | |
| large-scale stochastic programming | |
| Last-Iterate Convergence | |
| LDLT factorization | |
| Learning from Experts | |
| Learning in games | |
| Learning Theory | |
| learning to control | |
| learning to optimize | |
| least majorized element | |
| Leontief matrices | |
| Level set | |
| leverage scores | |
| LICQ | |
| Lifting | |
| line search-free methods | |
| Line-search | |
| line-search methods | |
| Linear Complementarity problem | |
| linear complementarity problems | |
| linear decision rule | |
| Linear Decision Rules | |
| linear optimization | |
| Linear optimization with linear and complementary constraints | |
| linear programming | |
| linear programming relaxation | |
| linear programs | |
| linear regression | |
| Linear Relaxation | |
| linear solvers | |
| Linear System | |
| Linearizable | |
| Linearization | |
| Linearly-Solvable Multi-Agent Games | |
| Lipschitz constant estimation | |
| Lloyd's Algorithm | |
| LNG Portfolio optimization | |
| local convergence | |
| Local Hamiltonian problem | |
| Local linear convergence | |
| local minima | |
| Local optima | |
| Local Ratio | |
| Local Search | |
| log-barrier smoothing | |
| Lot Sizing | |
| Lovász theta function | |
| low rank | |
| low-diameter clusters | |
| Low-rank functions | |
| Low-rank matrix optimization | |
| low-rank matrix recovery | |
| Low-Rank Optimization | |
| lower complexity bound | |
| Lyapunov stability | |
| M | |
| machine learning | |
| machine learning models | |
| Machine learning safety | |
| machine scheduling | |
| majorization | |
| Manifold | |
| Manifold Optimization | |
| margin maximization | |
| margin regularization | |
| Markov chain | |
| Markov Decision Processes | |
| Markov Games | |
| Markov Potential Games | |
| Markov random fields | |
| markovian processes | |
| Matching markets | |
| Mathematical Modeling | |
| Mathematical optimization solver | |
| matrix analysis | |
| matrix games | |
| Matroid Intersection | |
| max cut | |
| max-min fairness | |
| Maximal monotone | |
| Maximum algebraic connectivity | |
| Maximum clique problem | |
| Maximum Feasible Subsystem Problems | |
| Maximum Load | |
| maximum of d-homogeneous form in d-Holder norm | |
| measure divergence | |
| measure space optimization | |
| Median | |
| Medical Imaging | |
| Meta Learning | |
| Meta-Learning | |
| metaheuristic optimization | |
| Metaheuristics | |
| metal artifacts | |
| Method of multipliers | |
| metric subregularity | |
| MILP | |
| min-max | |
| Min-max optimization | |
| Min-max-min optimization | |
| Minimax Optimization | |
| minimax problems | |
| Minimum Enclosing Ellipsoid | |
| Minimum-Cost Flow | |
| Minkowski | |
| MINLP | |
| MIP | |
| misspecified case | |
| Mixed binary conic optimization | |
| Mixed Binary Quadratic Programming | |
| Mixed integer linear optimization | |
| Mixed Integer Nonlinear Program | |
| Mixed integer programming | |
| Mixed-integer linear optimization | |
| Mixed-integer linear programming | |
| Mixed-Integer Nonlinear Optimization | |
| Mixed-integer nonlinear programming | |
| Mixed-integer optimization | |
| mixed-integer programming | |
| Mixed-integer-biconvex program | |
| mixture models | |
| Mixture of experts | |
| mobility | |
| model refinement | |
| modeling | |
| modeling languages | |
| Moment-based ambiguity set | |
| Momentum | |
| Monte Carlo tree search | |
| Motion Planning | |
| Motzkin-Straus formulation | |
| MPC | |
| Multi-Agent | |
| Multi-agent Games | |
| multi-agent systems | |
| Multi-armed bandits | |
| multi-head attention | |
| multi-objective optimization | |
| Multi-stage stochastic programming | |
| Multi-Task Learning | |
| Multi-trip vehicle routing | |
| Multicommodity Flow | |
| multicommodity flows | |
| multifacility location problem | |
| Multilevel Optimization | |
| multilinear polytope | |
| Multimodal uncertainty | |
| multiobjective | |
| Multiobjective optimization | |
| Multiparametric Programming | |
| Multiple Testing | |
| Multiradial theory | |
| Multistage Optimization | |
| Multistage Stochastic Optimization | |
| Multistage stochastic program | |
| multistage stochastic programming | |
| N | |
| Nash Equilibria | |
| Nash equilibrium | |
| Near-optimality | |
| negative curvature | |
| Nesterov acceleration | |
| network | |
| Network design | |
| Network Interdiction | |
| Network Optimization | |
| Network resilience | |
| Networks | |
| Neural Network | |
| neural network design | |
| Neural network verification | |
| neural networks | |
| Neural tangent kernel | |
| Newton method | |
| No-code mathematical optimization | |
| no-regret online learning | |
| noise estimation | |
| noisy optimization | |
| non-asymptotic analysis | |
| non-convex | |
| non-convex non-smooth optimization | |
| non-convex optimization | |
| non-convex stochastic optimization | |
| non-Euclidean nonsmooth distance | |
| non-interior continuation path | |
| non-linear conjugate gradient | |
| Non-linear cutaneous Leishmaniasis disease model Bayesian Regularization Backpropagation | |
| Non-linear integer optimization | |
| non-linear optimization | |
| Non-profit | |
| Non-smooth Optimization | |
| Non-stationarity | |
| Non-symmetric conic optimization | |
| Nonconvex | |
| nonconvex learning | |
| nonconvex optimization | |
| nonconvex quadratic programming | |
| Nonconvex-concave Problem | |
| Nonconvex-Optimization | |
| nondominated set | |
| nonlinear complementarity | |
| nonlinear distance metrics | |
| Nonlinear inequality constraints | |
| nonlinear inverse problem | |
| nonlinear model predictive control | |
| nonlinear optimization | |
| nonlinear programming | |
| nonlinear systems | |
| Nonlinearly constrained optimization | |
| nonlocal variational denoising | |
| nonmonotone inclusion | |
| nonsmooth and nonconvex optimization | |
| Nonsmooth optimization | |
| nonstationary inverse problems | |
| NP-hardness | |
| Nuclear-norm regularization | |
| number of pivots | |
| Numerical analysis | |
| Numerical Optimization | |
| O | |
| O-minimal structure | |
| OBBT | |
| Observational data | |
| Offline policy learning | |
| Online Algorithm | |
| online allocation | |
| online learning | |
| Online Matching | |
| Online Optimisation | |
| Online Optimization | |
| Online resource allocation | |
| Open-source software | |
| operation complexity | |
| operator splitting | |
| Operator theory | |
| Optimal algorithm | |
| optimal control | |
| Optimal control problems | |
| optimal power flow | |
| Optimal transport | |
| Optimality conditions | |
| Optimisation | |
| optimisation under uncertainty | |
| Optimistic Gradient | |
| optimistic gradient method | |
| Optimistic Policy Iteration | |
| optimization | |
| Optimization Algorithms | |
| Optimization Approach | |
| optimization of risk | |
| Optimization software | |
| optimization solver | |
| optimization under decision-dependent uncertainty | |
| optimization under uncertainty | |
| optimization with side information | |
| OR in energy | |
| out-of-distribution generalization | |
| Outer Approximation | |
| over-parameterization | |
| over-smoothing | |
| Overlap | |
| overlap gap property | |
| overlapping districting | |
| P | |
| PAC learning | |
| PAC-Bayesian | |
| Parallel Algorithms | |
| Parallel and Vector Transport Approximation Bounds | |
| parallel computing | |
| parallel optimization | |
| Parameter Efficient Fine-tuning | |
| parameter estimation | |
| parameter-free | |
| parameter-free methods | |
| parametric optimization | |
| Partial differential equation | |
| Partial information | |
| Partial k-trees | |
| Partially Observability | |
| particle swarm optimization | |
| Particle Swarm Optimization (PSO) | |
| PDE constrained optimization | |
| PDE-constrained optimization | |
| PDHG | |
| Peaceman-Rachford splitting method | |
| Penalty-Methods | |
| Performance analysis | |
| Performance Estimation | |
| personalized healthcare | |
| Personalized System Design | |
| Perspective formulation | |
| perspective function | |
| Perspective functions | |
| Pessimism | |
| philosophy of modeling | |
| Physics for optimization | |
| pickup and delivery | |
| Piecewise linear Relaxations | |
| Piecewise Polyhedral Relaxations | |
| piecewise-smooth dynamics | |
| Planning | |
| policy gradient | |
| policy gradient method | |
| policy gradient methods | |
| Policy learning | |
| policy optimization | |
| political redistricting | |
| Polyak Method | |
| Polyak-Lojasiewicz condition | |
| Polyak-Łojasiewic inequality | |
| polyhedra | |
| Polyhedral approximation | |
| Polyhedral study | |
| Polyhedral theory | |
| polynomial complexity | |
| polynomial optimization | |
| Population-based | |
| Portfolio selection | |
| Positive Semidefinite Cone | |
| post-allocation service | |
| post-processing quantum algorithms | |
| Potential Games | |
| Power Distribution Systems | |
| power markets | |
| power systems | |
| power systems planning | |
| PPT | |
| Pre-conditioner | |
| Pre-Harvest | |
| Pre-training | |
| Precedence constraints | |
| Prediction Algorithms | |
| predictions | |
| prescriptive analytics | |
| price elasticity | |
| price of fairness | |
| Pricing | |
| pricing policy | |
| primal-dual hybrid gradient | |
| Primal-dual Methods | |
| Principal component analysis | |
| probabilistic graphical models | |
| Probabilistic set covering | |
| Probing | |
| process tomography | |
| Programming: Stochastic | |
| progress curves | |
| Progressive hedging | |
| projection-free | |
| Projection-Free Method | |
| Prophet Inequalities | |
| proportional fairness | |
| Protein structure prediction | |
| prox-linear | |
| Proximal | |
| Proximal algorithms | |
| proximal bundle method | |
| proximal gradient | |
| Proximal method | |
| Proximal point algorithm | |
| proximal point method | |
| Proximity | |
| pruning | |
| Pure Exploration | |
| Python | |
| Q | |
| Q-Learning | |
| qaoa | |
| QCQP | |
| QCQPs | |
| QIS | |
| Quadratic Assignment | |
| Quadratic assignment problem | |
| Quadratic constraints | |
| Quadratic Convergence | |
| Quadratic growth | |
| Quadratic Minimum Spanning Tree | |
| quadratic programming | |
| quadratically constrained quadratic programs | |
| quantum | |
| quantum advantages | |
| Quantum algorithm | |
| quantum algorithms | |
| Quantum annealing | |
| Quantum Approximate Optimization Algorithm | |
| Quantum Computation | |
| Quantum Computing | |
| Quantum federated learning | |
| Quantum generalization | |
| quantum Hamiltonian descent | |
| quantum information | |
| Quantum Interior Point Method | |
| Quantum IPM | |
| Quantum machine learning | |
| quantum optimization | |
| quantum query complexity | |
| Quantum simulation | |
| quantum singular value transformation | |
| Quantum speedup | |
| Quantum tensor networks | |
| Quantum tunneling | |
| Quantum walks | |
| quantum zero-chain method | |
| Quasi convex optimization problems | |
| quasi-Newton methods | |
| Quasi-optimal error estimates | |
| Quasiconvexity | |
| qubo | |
| Query Processing | |
| R | |
| Rademacher Average | |
| random block coordinate descent | |
| random graphs | |
| random matrices | |
| random matrix theory | |
| Random Networks | |
| randomized quasi-Monte Carlo | |
| Randomized subspace methods | |
| Rare events | |
| Re-scaling | |
| recommender systems | |
| Rectified relaxation | |
| Reduced Order Model | |
| refactorization | |
| Refereed Papers Only | |
| reformulation | |
| Reformulation method | |
| Reformulation-Linearization Technique | |
| Reformulation-perspectification technique | |
| refugee matching | |
| Regret analysis | |
| Regularization | |
| regularized regression | |
| Reinforcement Learning | |
| Relational database | |
| Relax-and-cut separation | |
| relaxation scheme | |
| Relay network design | |
| renewable energy | |
| representation theory | |
| Reproducibility | |
| resource allocation | |
| resource allocation problem | |
| Resource Augmentation | |
| Responsible AI | |
| Restless multi-armed bandits | |
| restricted Gaussian oracle | |
| Revenue management | |
| Ride-sourcing services | |
| Riemannian | |
| Riemannian Optimization | |
| Risk Averse | |
| Risk Measures | |
| risk scoring | |
| risk-averse optimization | |
| risk-aware optimization | |
| Risk-sensitive Decision-making | |
| Road Safety | |
| robust combinatorial optimization | |
| Robust Decision Making | |
| Robust Design | |
| robust IPM | |
| robust Markov decision process | |
| Robust nonlinear optimization | |
| robust optimization | |
| Robustness | |
| Rotation Matrices | |
| roundoff-error-free linear algebra | |
| Routing and scheduling | |
| S | |
| SaaS | |
| Saddle Point Problem | |
| saddlepoint | |
| saddlepoint problem | |
| sample average approximation | |
| Sample average approximations | |
| sample complexity | |
| sample-average approximation | |
| Sampling-free | |
| sandpile models | |
| Scalability | |
| Scalable Algorithm | |
| Scalable approximate optimization | |
| scale-up | |
| scarce resource allocation | |
| Scheduling | |
| Schur-convexity | |
| scientific machine learning | |
| Score matching | |
| SDP | |
| search theory | |
| Second Order Cone | |
| Second-Derivative Methods | |
| Second-order conic optimization | |
| Second-order Method | |
| Second-order stochastic dominance | |
| Sectoral portfolio optimization | |
| securitization | |
| security | |
| Security and Stackelberg Games | |
| security constrained unit commitment | |
| security games | |
| Security-constrained unit commitment | |
| Semi-algebraic function | |
| Semi-infinite optimization | |
| Semi-infinite programming | |
| Semi-Smooth Newton Method | |
| semi-smooth potential | |
| semi-stochastic gradient methods | |
| Semidefinite optimization | |
| semidefinite programming | |
| Semidefinite programming relaxation | |
| Semidefinite programs | |
| Semidefinite Relaxations | |
| semidefinte programming | |
| Semigroups | |
| sensitivities | |
| Sensitivity Analysis | |
| Sequential decision making | |
| Sequential Decision-Making | |
| Sequential Decision-making under Uncertainty | |
| sequential quadratic programming | |
| Sequential sampling | |
| service systems | |
| Set Covering | |
| set functions | |
| set system approximation | |
| Set-Membership Estimation | |
| Shamir’s secret sharing | |
| shared rides | |
| sharpness | |
| SI model | |
| Side-chain positioning | |
| signaling pathways | |
| Simple bilevel optimization | |
| Simplex methods | |
| SimPy | |
| simulation metamodeling | |
| simulation optimization | |
| simultaneous optimization | |
| sketching | |
| sliding motion | |
| Smooth | |
| Smooth Convex Optimization | |
| Smooth optimization | |
| social welfare optimization | |
| software | |
| software packages | |
| Software tools | |
| solver | |
| spacecraft trajectory design | |
| sparse PCA | |
| sparsity | |
| Spatiotemporal Beamforming | |
| spectral bundle method | |
| Spectral bundle methods | |
| spectral radius of hypergraph | |
| spectral radius of nonnegative tensor | |
| spin glass | |
| SQP | |
| SQP Methods | |
| Stability | |
| Stackelberg equilibrium | |
| stackelberg games | |
| Standard polynomial programming | |
| Star bodies | |
| state space relaxations | |
| stationary point | |
| statistical learning theory | |
| Statistical mechanics | |
| stochastic algorithms | |
| stochastic approximation | |
| Stochastic Augmented Lagrangian | |
| stochastic constraints | |
| Stochastic Convex Optimization | |
| stochastic decomposition | |
| Stochastic derivative-free optimization | |
| stochastic dominance | |
| stochastic dual dynamic programming | |
| stochastic extragradient | |
| stochastic first-order methods | |
| Stochastic Gradient Descent | |
| stochastic gradient descent ascent | |
| stochastic gradient method | |
| stochastic gradient methods | |
| Stochastic mirror descent with biased gradient oracles | |
| Stochastic mixed-integer programming | |
| Stochastic Optimization | |
| stochastic oracle | |
| stochastic oracles | |
| Stochastic Policies | |
| Stochastic Polyak Stepsize | |
| Stochastic Programming | |
| stochastic sequential quadratic optimization | |
| Stochastic variational inequalities | |
| Stochastic-Robust Optimization | |
| stochatic policy gradient | |
| strategic agents | |
| strategic classification | |
| streaming algorithms | |
| streaming model | |
| Strict Complementarity | |
| Strong Partitioning | |
| Structured reinforcement learning | |
| Student-t process | |
| Sub-gradient | |
| Subgradient Optimization | |
| submodular | |
| submodular polyhedra | |
| Submodularity | |
| Successive Refinement Algorithm | |
| sum of squares | |
| Sum-of-squares optimization | |
| super-linear correction | |
| superadditive duality | |
| superlinear convergence | |
| superlinear local convergence | |
| superquantile | |
| supervalid inequalities | |
| Supervised classification | |
| Supply Chain | |
| Supply chain management | |
| Surface Mount Technology (SMT) | |
| surrogate modeling | |
| Surrogate Models | |
| surrogates | |
| sustainability | |
| switching manifolds | |
| symbolic analysis | |
| Symbolic Learning | |
| symmetry | |
| system design optimization | |
| system identification | |
| Systemic risk measure | |
| T | |
| task-based learning | |
| Technoeconomic Analysis | |
| Tensor completion | |
| Tensor Format | |
| tensor optimal transport | |
| The k-center problem | |
| Thresholds | |
| Time Series Forecast | |
| Time series models | |
| Time-varying networks | |
| time-varying parameters | |
| totally unimodular linear programs | |
| training dynamics | |
| transfer learning | |
| transformer | |
| transformers | |
| Transmission expansion planning | |
| Transportation planning | |
| Traveling Salesman Problem | |
| Traveling Salesman Problem (TSP) | |
| Trust Region | |
| Trust-region algorithms | |
| trust-region methods | |
| trustworthy AI | |
| Tuning-Free | |
| Two Team zero-sum games | |
| two-layer neural network | |
| two-metric projection | |
| two-stage optimization | |
| Two-stage stochastic programming | |
| U | |
| uncertainty | |
| Unconstrained Binary Nonlinear Programming Problem | |
| Unconstrained minimization | |
| under-estimators | |
| Uniform Convergence | |
| uniformly optimal methods | |
| Unit Commitment | |
| Unit commitment problems | |
| universal method | |
| Universal relaxation theory | |
| Urban Air Mobility | |
| V | |
| Valid inequalities | |
| value-at-risk | |
| Variable fixing | |
| variable-bound tightening | |
| variational inequalities | |
| variational inequality | |
| Vegetable Crops | |
| Vehicle Restraint System | |
| vehicle routing | |
| verification tools | |
| Vertex Cover | |
| W | |
| Warm-Starts | |
| warped proximal iteration | |
| Wasserstein Ambiguity Set | |
| Wasserstein distance-based ambiguity set | |
| Wasserstein distributionally robust optimization | |
| Wasserstein metric | |
| Waste management | |
| Water Treatment | |
| Weakly convex optimization | |
| weakly coupled Markov Decision Processes | |
| Weierstrass preparation theorem | |
| Weight Decay | |
| Whittle index policy | |
| wind uncertainty | |
| working index set | |
| workload balancing | |
| Worm Optimization (WO) | |
| worst-case complexity | |
| Z | |
| Z-matrices | |
| zero-one loss | |
| zero-sum game objectives with hidden structure | |
| zero-sum games | |
| Zero-Sum Markov Games | |
| Zeroth-order methods | |
| zeroth-order optimization | |