Copertina

Sparse Polynomial Optimization with Unbounded Sets

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Huang, Lei, Kang, Shucheng, Wang, Jie, Yang, Heng
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control 90C23, 90C17, 90C22, 90C26
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Sparse Polynomial Matrix Optimization
di: Miller, Jared, et al.
Pubblicazione: (2024)

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
di: Guo, Feng, et al.
Pubblicazione: (2023)

A Bilevel Hierarchy of Strengthened Complex Moment Relaxations for Complex Polynomial Optimization
di: Wang, Jie
Pubblicazione: (2024)

Exploiting Sign Symmetries in Minimizing Sums of Rational Functions
di: Guo, Feng, et al.
Pubblicazione: (2024)

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
di: Slot, Lucas, et al.
Pubblicazione: (2024)

Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel
di: Slot, Lucas
Pubblicazione: (2021)

A Moment-QSOS Hierarchy for a Class of Quaternion Polynomial Optimization Problems
di: Liu, Yanqing, et al.
Pubblicazione: (2026)

Exploiting Sparsity in Complex Polynomial Optimization
di: Wang, Jie, et al.
Pubblicazione: (2021)

Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation
di: Wang, Jie
Pubblicazione: (2022)

Sparse convex relaxations in polynomial optimization
di: Averkov, Gennadiy, et al.
Pubblicazione: (2024)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
di: Hou, Di, et al.
Pubblicazione: (2025)

An Overview of Convergence Rates for Sum of Squares Hierarchies in Polynomial Optimization
di: Laurent, Monique, et al.
Pubblicazione: (2024)

Outer Approximation Scheme for Weakly Convex Constrained Optimization Problems
di: Bednarczuk, Ewa M., et al.
Pubblicazione: (2024)

A more efficient reformulation of complex SDP as real SDP
di: Wang, Jie
Pubblicazione: (2023)

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
di: Gómez-Casares, Ignacio, et al.
Pubblicazione: (2025)

An extension of an RLT-based solver to MINLP polynomial problems
di: González-Díaz, Julio, et al.
Pubblicazione: (2024)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
di: González-Díaz, Julio, et al.
Pubblicazione: (2025)

Solving Low-Rank Semidefinite Programs via Manifold Optimization
di: Wang, Jie, et al.
Pubblicazione: (2023)

A parameter-free approach for solving SOS-convex semi-algebraic fractional programs
di: Yang, Chengmiao, et al.
Pubblicazione: (2024)

Piecewise SOS-Convex Moment Optimization and Applications via Exact Semi-Definite Programs
di: Huang, Queenie Yingkun, et al.
Pubblicazione: (2024)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
di: Arima, Naohiko, et al.
Pubblicazione: (2023)

An Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c
di: Fujii, Koichi, et al.
Pubblicazione: (2023)

Solving clustered low-rank semidefinite programs arising from polynomial optimization
di: Leijenhorst, Nando, et al.
Pubblicazione: (2022)

Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
di: Nguyen, Vinh
Pubblicazione: (2025)

DC Semidefinite Programming and Cone Constrained DC Optimization: Theory and Local Search Methods
di: Dolgopolik, M. V.
Pubblicazione: (2021)

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
di: Namchaisiri, Charles, et al.
Pubblicazione: (2024)

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
di: Namchaisiri, Charles, et al.
Pubblicazione: (2024)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
di: Marumo, Hiroki, et al.
Pubblicazione: (2024)

On the convexity for the range set of two quadratic functions
di: Nguyen, Huu-Quang, et al.
Pubblicazione: (2025)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
di: Arima, Naohiko, et al.
Pubblicazione: (2024)

Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization
di: Deng, Kangkang, et al.
Pubblicazione: (2024)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
di: Kojima, Masakazu, et al.
Pubblicazione: (2025)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
di: Qu, Zheng, et al.
Pubblicazione: (2023)

A minimal face constant rank constraint qualification for reducible conic programming
di: Andreani, Roberto, et al.
Pubblicazione: (2023)

Beyond binarity: Semidefinite programming for ternary quadratic problems
di: de Meijer, Frank, et al.
Pubblicazione: (2026)

Separable QCQPs and Their Exact SDP Relaxations
di: Kojima, Masakazu, et al.
Pubblicazione: (2026)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
di: Kojima, Masakazu, et al.
Pubblicazione: (2025)

The link between $1$-norm approximation and effective Positivstellensatze for the hypercube
di: de Klerk, Etienne, et al.
Pubblicazione: (2024)

Duality attainment and strict feasibility of the generalized moment problem and its relaxations
di: Halaseh, Sami, et al.
Pubblicazione: (2026)

A Dual Riemannian ADMM Algorithm for Low-Rank SDPs with Unit Diagonal
di: Wang, Jie, et al.
Pubblicazione: (2025)