Imagen de Portada

Polyhedral results for two classes of submodular sets with GUB constraints

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Qian, Weikang, Li, Keyan, Chen, Wei-Kun, Dai, Yu-Hong
Formato:	Preprint
Publicado:	2026
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On strong valid inequalities for a class of mixed-integer nonlinear sets with box constraints
por: Li, Keyan, et al.
Publicado: (2026)

Towards large-scale probabilistic set covering problems: an efficient Benders decomposition approach
por: Lv, Wei, et al.
Publicado: (2024)

Benders decomposition for the large-scale probabilistic set covering problem
por: Liang, Jie, et al.
Publicado: (2025)

On submodularity of the expected information gain
por: Maio, Steven, et al.
Publicado: (2025)

Distributionally robust optimization through the lens of submodularity
por: Natarajan, Karthik, et al.
Publicado: (2023)

A brief note on approximate optimization of submodular functions
por: Alexanderian, Alen
Publicado: (2025)

Efficient exact sequential lifting algorithm for binary knapsack set
por: Wang, Xintong, et al.
Publicado: (2026)

Boosting Gradient Ascent for Continuous DR-submodular Maximization
por: Zhang, Qixin, et al.
Publicado: (2024)

Monotonicity and Contraction on Polyhedral Cones
por: Jafarpour, Saber, et al.
Publicado: (2022)

Polyhedral Control Design: Theory and Methods
por: Houska, Boris, et al.
Publicado: (2024)

Convexification of classes of mixed-integer sets with L$^\natural$-convexity
por: Yu, Qimeng, et al.
Publicado: (2025)

Continuous Non-monotone DR-submodular Maximization with Down-closed Convex Constraint
por: Chen, Shengminjie, et al.
Publicado: (2023)

A Polyhedral Study on Unit Commitment with a Single Type of Binary Variables
por: Tian, Bin, et al.
Publicado: (2026)

Polyhedral Analysis of Quadratic Optimization Problems with Stieltjes Matrices and Indicators
por: Liu, Peijing, et al.
Publicado: (2024)

Control Lyapunov Function Design via Configuration-Constrained Polyhedral Computing
por: Houska, Boris, et al.
Publicado: (2025)

Convexification of a Separable Function over a Polyhedral Ground Set
por: Dey, Santanu S., et al.
Publicado: (2025)

An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints
por: Hien, Le Thi Khanh, et al.
Publicado: (2022)

A new polynomially solvable class of quadratic optimization problems with box constraints
por: Hladík, Milan, et al.
Publicado: (2019)

Adapting Polyhedral Dominance Cones to Ordinal Preference Structures
por: Klamroth, Kathrin, et al.
Publicado: (2026)

An efficient sieving based secant method for sparse optimization problems with least-squares constraints
por: Li, Qian, et al.
Publicado: (2023)

Active-set Newton-MR methods for nonconvex optimization problems with bound constraints
por: Birgin, Ernesto G., et al.
Publicado: (2025)

Presolving and cutting planes for the generalized maximal covering location problem
por: Lv, Wei, et al.
Publicado: (2024)

Heuristic Bundle Upper Bound Based Polyhedral Bundle Method for Semidefinite Programming
por: Cui, Zilong, et al.
Publicado: (2025)

Finite Convergence of Circumcentered-Reflection Method on Closed Polyhedral Cones in Euclidean Spaces
por: Liao, Hongzhi
Publicado: (2024)

SOC-ICNN: From Polyhedral to Conic Geometry for Learning Convex Surrogate Functions
por: Liu, Kang, et al.
Publicado: (2026)

Reachability Analysis of Nonlinear Discrete-Time Systems Using Polyhedral Relaxations and Constrained Zonotopes
por: Rego, Brenner S., et al.
Publicado: (2025)

An efficient branch-and-cut approach for the sequential competitive facility location problem under partially binary rule
por: Guo, Yu-Qi, et al.
Publicado: (2025)

A mechanism of three-dimensional quadratic termination for the gradient method with applications
por: Huang, Yakui, et al.
Publicado: (2022)

Modified Polyhedral Method for Elicitation of Shape-Free Utility and Conservatism Reduction in Robust Optimization
por: Zhang, Sainan, et al.
Publicado: (2025)

Hausdorff compactness and regularity for classes of open sets under geometric constraints
por: Barkatou, Mohamed
Publicado: (2026)

Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints
por: Roberts, Lindon, et al.
Publicado: (2026)

$\mathcal{V}$-Polyhedral Disjunctive Cuts
por: Balas, Egon, et al.
Publicado: (2022)

Universal Architectures for the Learning of Polyhedral Norms and Convex Regularizers
por: Unser, Michael, et al.
Publicado: (2025)

Error bound and exact penalty method for optimization problems with nonnegative orthogonal constraint
por: Qian, Yitian, et al.
Publicado: (2021)

An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule
por: Chen, Wei-Kun, et al.
Publicado: (2024)

Enhanced Barrier-Smoothing Technique for Bilevel Optimization with Nonsmooth Mappings
por: Xu, Mengwei, et al.
Publicado: (2024)

When Deep Learning Meets Polyhedral Theory: A Survey
por: Huchette, Joey, et al.
Publicado: (2023)

Complexity results and active-set identification of a derivative-free method for bound-constrained problems
por: Brilli, Andrea, et al.
Publicado: (2024)

An Efficient Stochastic Subgradient Method for the Global Placement Problem in Very Large-Scale Integration Circuits
por: Yue, Yi-Shuang, et al.
Publicado: (2024)

On Connections Between Association Schemes and Analyses of Polyhedral and Positive Semidefinite Lift-and-Project Relaxations
por: Au, Yu Hin, et al.
Publicado: (2020)