Cover Image

A polynomial-time solvable class of sparse box-constrained polynomial optimization problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Khajavirad, Aida
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Tight semidefinite programming relaxations for sparse box-constrained quadratic programs
by: Khajavirad, Aida
Published: (2026)

Inference in higher-order undirected graphical models and binary polynomial optimization
by: Khajavirad, Aida, et al.
Published: (2024)

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
by: Del Pia, Alberto, et al.
Published: (2023)

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

The complete edge relaxation for binary polynomial optimization
by: Del Pia, Alberto, et al.
Published: (2025)

The circle packing problem: a theoretical comparison of various convexification techniques
by: Khajavirad, Aida
Published: (2024)

A second-order cone representable class of nonconvex quadratic programs
by: Dey, Santanu S., et al.
Published: (2025)

Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization
by: Del Pia, Alberto, et al.
Published: (2024)

Term-sparse polynomial optimization for the design of frame structures
by: Handa, Marouan, et al.
Published: (2025)

Robust approximation of chance constrained optimization with polynomial perturbation
by: Rao, Bo, et al.
Published: (2022)

A black-box optimization method with polynomial-based kernels and quadratic-optimization annealing
by: Minamoto, Yuki, et al.
Published: (2025)

Degree reduction techniques for polynomial optimization problems
by: González-Rodríguez, Brais, et al.
Published: (2024)

Rank-one Boolean tensor factorization and the multilinear polytope
by: Del Pia, Alberto, et al.
Published: (2022)

Extended formulations for the multilinear polytope of acyclic hypergraphs
by: Del Pia, Alberto, et al.
Published: (2025)

Solving moment and polynomial optimization problems on Sobolev spaces
by: Henrion, Didier, et al.
Published: (2024)

EM algorithms for optimization problems with polynomial objectives
by: Asai, Kensuke, et al.
Published: (2024)

Taylor polynomial-based constrained solver for fuel-optimal low-thrust trajectory optimisation
by: Caleb, Thomas, et al.
Published: (2025)

On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms
by: Ketkov, Sergey S., et al.
Published: (2024)

Slow convergence of the moment-SOS hierarchy for an elementary polynomial optimization problem
by: Henrion, Didier, et al.
Published: (2024)

Consumption and portfolio optimization solvable problems with recursive preferences
by: Kang, Jian-hao, et al.
Published: (2023)

A novel exact approach to polynomial optimization
by: Bertsimas, Dimitris, et al.
Published: (2025)

Homogenization for polynomial optimization with unbounded sets
by: Huang, Lei, et al.
Published: (2021)

Global optimization of low-rank polynomials
by: Gaggioli, Llorenç Balada, et al.
Published: (2025)

A variable smoothing for Nonconvexly constrained nonsmooth optimization with application to sparse spectral clustering
by: Kume, Keita, et al.
Published: (2023)

Alternating direction method of multipliers for polynomial optimization
by: Cerone, V., et al.
Published: (2025)

Composition and tensor train structure in polynomial optimization
by: Gaggioli, Llorenç Balada, et al.
Published: (2026)

Convergence rates for polynomial optimization on set products
by: Magron, Victor
Published: (2025)

A smoothing moving balls approximation method for a class of conic-constrained difference-of-convex optimization problems
by: Xu, Jiefeng, et al.
Published: (2025)

Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem
by: Liu, Juan, et al.
Published: (2024)

Factorized binary polynomial optimization
by: Del Pia, Alberto
Published: (2024)

Geometry of exactness of moment-SOS relaxations for polynomial optimization
by: Henrion, Didier
Published: (2023)

Rank conditions for exactness of semidefinite relaxations in polynomial optimization
by: Lasserre, Jean B
Published: (2025)

Global weight optimization of frame structures with polynomial programming
by: Tyburec, Marek, et al.
Published: (2022)

SPLD polynomial optimization and bounded degree SOS hierarchies
by: Jiao, Liguo, et al.
Published: (2025)

Characterization of optimization problems that are solvable iteratively with linear convergence
by: Alimisis, Foivos
Published: (2024)

Calm local optimality for couple-constrained minimax problems
by: Ma, Xiaoxiao, et al.
Published: (2025)

The algebraic degree of sparse polynomial optimization
by: Lindberg, Julia, et al.
Published: (2023)

Adaptive sieving: A dimension reduction technique for sparse optimization problems
by: Yuan, Yancheng, et al.
Published: (2023)

A strongly polynomial-time algorithm for the general linear programming problem
by: Awoniyi, Samuel
Published: (2025)

Univariate representations of solutions to generic polynomial complementarity problems
by: Hieu, Vu Trung, et al.
Published: (2024)