Copertina

Piecewise SOS-Convex Moment Optimization and Applications via Exact Semi-Definite Programs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Huang, Queenie Yingkun, Jeyakumar, Vaithilingam, Li, Guoyin
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control 90C22, 90C26
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

Exact Convex Reformulations of Linear Neural Networks via Completely Positive Lifting
di: Prakhya, Karthik, et al.
Pubblicazione: (2026)

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

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

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

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

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

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

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

Sparse Polynomial Optimization with Unbounded Sets
di: Huang, Lei, 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 Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c
di: Fujii, Koichi, et al.
Pubblicazione: (2023)

Sparse Polynomial Matrix Optimization
di: Miller, Jared, et al.
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)

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)

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

Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs
di: Yildirim, E. Alper
Pubblicazione: (2025)

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
di: Jung, Woosuk L., et al.
Pubblicazione: (2023)

Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones
di: Neira, David E. Bernal, et al.
Pubblicazione: (2021)

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

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

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)

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

Non-SOS Positivstellensätze for semi-algebraic sets defined by polynomial matrix inequalities
di: Guo, Feng
Pubblicazione: (2025)

An efficient proximal algorithm for squared L1 over L2 regularized sparse recovery
di: Zhang, Na, et al.
Pubblicazione: (2025)

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

Convergence rates of S.O.S hierarchies for polynomial semidefinite programs
di: Tran, Hoang Anh, et al.
Pubblicazione: (2024)

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
di: Göß, Adrian
Pubblicazione: (2026)

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

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

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

Stochastic Optimization under Hidden Convexity
di: Fatkhullin, Ilyas, et al.
Pubblicazione: (2023)

Variance Reduced Distributed Non-Convex Optimization Using Matrix Stepsizes
di: Li, Hanmin, et al.
Pubblicazione: (2023)

Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
di: de Brito, Jose, et al.
Pubblicazione: (2026)