:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Qian, Weikang, Li, Keyan, Chen, Wei-Kun, Dai, Yu-Hong
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2601.18360
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

QoS-Aware and Routing-Flexible Network Slicing for Service-Oriented Networks
by: Chen, Wei-Kun, et al.
Published: (2024)

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

Exploiting Overlap Information in Chance-constrained Program with Random Right-hand Side
by: Lv, Wei, et al.
Published: (2024)

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

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

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

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

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