The following pages link to Kostas Margellos (Q313285):
Displayed 32 items.
- On the computational complexity and generalization properties of multi-stage and stage-wise coupled scenario programs (Q313286) (← links)
- Dual decomposition for multi-agent distributed optimization with coupling constraints (Q1680912) (← links)
- Price of anarchy in electric vehicle charging control games: when Nash equilibria achieve social welfare (Q1716453) (← links)
- A decentralized approach to multi-agent MILPs: finite-time feasibility and performance guarantees (Q1737812) (← links)
- A dynamic programming framework for optimal delivery time slot pricing (Q2030595) (← links)
- Gradient-bounded dynamic programming for submodular and concave extensible value functions with probabilistic performance guarantees (Q2059319) (← links)
- Probabilistic feasibility guarantees for solution sets to uncertain variational inequalities (Q2071967) (← links)
- A time-triggered dimension reduction algorithm for the task assignment problem (Q2095343) (← links)
- Viable set computation for hybrid systems (Q2252963) (← links)
- Subgradient averaging for multi-agent optimisation with different constraint sets (Q2665377) (← links)
- On the probabilistic feasibility of solutions in multi-agent optimization problems under uncertainty (Q2667503) (← links)
- Multi-objective low-thrust spacecraft trajectory design using reachability analysis (Q2681188) (← links)
- Probabilistic feasibility guarantees for convex scenario programs with an arbitrary number of discarded constraints (Q2683215) (← links)
- A Scenario Approach for Non-Convex Control Design (Q2980661) (← links)
- On the Connection Between Compression Learning and Scenario Based Single-Stage and Cascading Optimization Problems (Q2982553) (← links)
- On the Road Between Robust Optimization and the Scenario Approach for Chance Constrained Optimization Problems (Q2983091) (← links)
- On the Convergence of a Regularized Jacobi Algorithm for Convex Optimization (Q4567170) (← links)
- Finite-Time Distributed Averaging Over Gossip-Constrained Ring Networks (Q4630111) (← links)
- Probably Approximately Correct Nash Equilibrium Learning (Q4957715) (← links)
- Hamilton–Jacobi Formulation for Reach–Avoid Differential Games (Q5347804) (← links)
- Distributed constrained optimization and consensus in uncertain networks via proximal minimization (Q5375220) (← links)
- On the Exact Feasibility of Convex Scenario Programs With Discarded Constraints (Q6053238) (← links)
- On the Sensitivity of Linear Resource Sharing Problems to the Arrival of New Agents (Q6137502) (← links)
- Regularized Jacobi iteration for decentralized convex optimization with separable constraints (Q6272920) (← links)
- Finite time distributed averaging over ring networks (Q6277000) (← links)
- Energy management for building district cooling: a distributed approach to resource sharing (Q6278843) (← links)
- A Concave Value Function Extension for the Dynamic Programming Approach to Revenue Management in Attended Home Delivery (Q6315679) (← links)
- A posteriori probabilistic feasibility guarantees for Nash equilibria in uncertain multi-agent games (Q6337393) (← links)
- Gradient-Bounded Dynamic Programming with Submodular and Concave Extensible Value Functions (Q6341239) (← links)
- Approximate Dynamic Programming for Delivery Time Slot Pricing: a Sensitivity Analysis (Q6346365) (← links)
- Multi-objective low-thrust spacecraft trajectory design using reachability analysis (Q6420517) (← links)
- A priori data-driven robustness guarantees on strategic deviations from generalised Nash equilibria (Q6432762) (← links)