No article text was recorded for this version.
constraint tightening
Version 1 of 142 papers56 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Achieving Zero Constraint Violation for Constrained Reinforcement Learning via Primal-Dual Approach
- Blog: Online convex optimization for cumulative constraints
- Blog: Resilient Distributed Optimization Algorithms for Resource Allocation
- Blog: Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints
- Blog: Safe Posterior Sampling for Constrained MDPs with Bounded Constraint Violation
- Blog: Conservative Stochastic Optimization With Expectation Constraints
- Blog: Triple-Q: A Model-Free Algorithm for Constrained Reinforcement Learning with Sublinear Regret and Zero Constraint Violation
- Blog: Last-Iterate Convergent Policy Gradient Primal-Dual Methods for Constrained MDPs
- Blog: Learning Policies with Zero or Bounded Constraint Violation for Constrained MDPs
- Blog: Achieving Zero Constraint Violation for Constrained Reinforcement Learning via Conservative Natural Policy Gradient Primal-Dual Algorithm
- Blog: Causal Logistic Bandits with Counterfactual Fairness Constraints
- Blog: Learning soft constrained MPC value functions: Efficient MPC design and implementation providing stability and safety guarantees
- Blog: Confident Natural Policy Gradient for Local Planning in $q_\pi$-realizable Constrained MDPs
- Blog: Neyman-Pearson classification under a strict constraint
- Blog: Concave Utility Reinforcement Learning with Zero-Constraint Violations
- Blog: A Lyapunov-Based Methodology for Constrained Optimization with Bandit Feedback
- Blog: Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes
- Blog: Constrained Online Convex Optimization with Polyak Feasibility Steps
- Blog: Near-Optimal Sample Complexity Bounds for Constrained MDPs
- Blog: Nearly Optimal Competitive Ratio for Online Allocation Problems with Two-sided Resource Constraints and Finite Requests
- Blog: Multi-Agent Safe Policy Learning for Power Management of Networked Microgrids
- Blog: Achieving Sub-linear Regret in Infinite Horizon Average Reward Constrained MDP with Linear Function Approximation
- Blog: Provably Efficient Model-Free Algorithms for Non-stationary CMDPs
- Blog: Optimizable Control Barrier Functions to Improve Feasibility and Add Behavior Diversity while Ensuring Safety
- Blog: Learning Parametric Constraints in High Dimensions from Demonstrations
- Blog: Constrained Variational Inference via Safe Particle Flow
- Blog: Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints
- Blog: DeepOPF+: A Deep Neural Network Approach for DC Optimal Power Flow for Ensuring Feasibility
- Blog: Anytime-Constrained Reinforcement Learning
- Blog: Towards Safe and Optimal Online Bidding: A Modular Look-ahead Lyapunov Framework
- Blog: Stochastic Convex Optimization with Multiple Objectives
- Blog: Online Optimal Control with Affine Constraints
- Blog: Policy-based Primal-Dual Methods for Concave CMDP with Variance Reduction
- Blog: A Provably-Efficient Model-Free Algorithm for Infinite-Horizon Average-Reward Constrained Markov Decision Processes
- Blog: Model-Free, Regret-Optimal Best Policy Identification in Online CMDPs
- Blog: A Primal-Dual-Critic Algorithm for Offline Constrained Reinforcement Learning
- Blog: End-to-End Imitation Learning with Safety Guarantees using Control Barrier Functions
- Blog: Bandits with concave rewards and convex knapsacks
- Blog: Near-Optimal Sample Complexity Bounds for Constrained Average-Reward MDPs
- Blog: Online Nonstochastic Control with Convex Safety Constraints
- Blog: Safe Dual Gradient Method for Network Utility Maximization Problems
- Blog: Stochastic Package Queries in Probabilistic Databases
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_constraint_tightening_042a6baf,
title = {constraint tightening},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/constraint-tightening/rdr_042a6baf7d3a427d8058c7b6d87a20df},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_constraint_tightening_042a6baf_v1,
title = {constraint tightening},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/constraint-tightening/rdr_042a6baf7d3a427d8058c7b6d87a20df/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}