Cover Image

The Boolean polynomial polytope with multiple choice constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shao, Sihong, Wu, Yishan
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Combinatorics 90C09, 52B12, 90C57, 05C65, 90C26
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An ODE approach to multiple choice polynomial programming
by: Shao, Sihong, et al.
Published: (2022)

On cone partitions for the min-cut and max-cut problems with non-negative edges
by: Nikolaev, Andrei V., et al.
Published: (2023)

Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
by: Nikolaev, Andrei V., et al.
Published: (2022)

Continuous iterative algorithms for anti-Cheeger cut
by: Shao, Sihong, et al.
Published: (2021)

New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions
by: Tawarmalani, Mohit
Published: (2024)

An Algorithm to Solve Cardinality Constrained Quadratic Optimization Problem with an Application to the Best Subset Selection in Regression
by: Singh, Vikram, et al.
Published: (2025)

From linear programming to colliding particles
by: Black, Alexander E., et al.
Published: (2024)

On 1-skeleton of the cut polytopes
by: Nikolaev, Andrei V.
Published: (2024)

A simple iterative algorithm for maxcut
by: Shao, Sihong, et al.
Published: (2018)

Binary Cyclic Transversal Polytopes
by: Frede, Jonas, et al.
Published: (2024)

Steiner Cut Dominants
by: Conforti, Michele, et al.
Published: (2022)

Global optimization of multivariable functions satisfying the Vanderbei condition
by: Arutyunova, Natalya, et al.
Published: (2019)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
by: Niu, Yi-Shuai, et al.
Published: (2018)

Conductance Estimation in Digraphs: Submodular Transformation, Lovász Extension and Dinkelbach Iteration
by: Shao, Sihong, et al.
Published: (2025)

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
by: Dolgopolik, M. V.
Published: (2021)

A truncated epsilon-subdifferential method for global DC optimization
by: Bagirov, Adil M., et al.
Published: (2025)

Riemannian Trust Region Methods for SC$^1$ Minimization
by: Zhang, Chenyu, et al.
Published: (2023)

Inexact Limited Memory Bundle Method
by: Lampainen, Jenni, et al.
Published: (2026)

On the Circuit Diameter Conjecture for Counterexamples to the Hirsch Conjecture
by: Black, Alexander E., et al.
Published: (2023)

Cutting planes for signomial programming
by: Xu, Liding, et al.
Published: (2022)

A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming
by: Huo, Xinyue, et al.
Published: (2024)

Nonmonotone subgradient methods based on a local descent lemma
by: Aragón-Artacho, Francisco J., et al.
Published: (2025)

Multivariate approximation by polynomial and generalised rational functions
by: Millán, R. Díaz, et al.
Published: (2021)

Unimodular polytopes and column number bounds on polytopal totally unimodular matrices via Seymour's decomposition theorem
by: Nill, Benjamin
Published: (2024)

Distributed accelerated proximal conjugate gradient methods for multi-agent constrained optimization problems
by: Gebrie, Anteneh Getachew
Published: (2023)

A simple inverse power method for balanced graph cut
by: Shao, Sihong, et al.
Published: (2024)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
by: Brosch, Daniel, et al.
Published: (2025)

A stochastic use of the Kurdyka-Lojasiewicz property: Investigation of optimization algorithms behaviours in a non-convex differentiable framework
by: Fest, Jean-Baptiste, et al.
Published: (2023)

Randomized block proximal method with locally Lipschitz continuous gradient
by: Pérez-Aros, Pedro, et al.
Published: (2025)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
by: Kanzow, Christian, et al.
Published: (2025)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
by: Zhou, Junpeng, et al.
Published: (2025)

Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
by: Turan, Evren M., et al.
Published: (2023)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
by: Takahashi, Shota, et al.
Published: (2025)

Exponential Lower Bounds for Many Pivot Rules for the Simplex Method
by: Black, Alexander E.
Published: (2024)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

A simulation-optimization approach for fractional, profitability-oriented inventory control under service-level type constraints
by: Sun, Tianxiao, et al.
Published: (2026)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
by: Deng, Kangkang, et al.
Published: (2024)

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
by: Chen, Xiaojun, et al.
Published: (2022)

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms
by: Bestuzheva, Ksenia, et al.
Published: (2022)

Determining inscribability of polytopes via rank minimization based on slack matrices
by: Chen, Yiwen, et al.
Published: (2025)