Image de couverture de livre

A Bilevel Hierarchy of Strengthened Complex Moment Relaxations for Complex Polynomial Optimization

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Wang, Jie
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control Primary, 90C23, Secondary, 90C22, 90C26
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
par: Guo, Feng, et autres
Publié: (2023)

A Moment-QSOS Hierarchy for a Class of Quaternion Polynomial Optimization Problems
par: Liu, Yanqing, et autres
Publié: (2026)

Sparse Polynomial Matrix Optimization
par: Miller, Jared, et autres
Publié: (2024)

Sparse Polynomial Optimization with Unbounded Sets
par: Huang, Lei, et autres
Publié: (2024)

Solving Low-Rank Semidefinite Programs via Manifold Optimization
par: Wang, Jie, et autres
Publié: (2023)

A Dual Riemannian ADMM Algorithm for Low-Rank SDPs with Unit Diagonal
par: Wang, Jie, et autres
Publié: (2025)

Exploiting Sparsity in Complex Polynomial Optimization
par: Wang, Jie, et autres
Publié: (2021)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
par: Hou, Di, et autres
Publié: (2025)

Exploiting Sign Symmetries in Minimizing Sums of Rational Functions
par: Guo, Feng, et autres
Publié: (2024)

An Overview of Convergence Rates for Sum of Squares Hierarchies in Polynomial Optimization
par: Laurent, Monique, et autres
Publié: (2024)

Optimistic Bilevel Optimization with Composite Lower-Level Problem
par: Solla, Mattia, et autres
Publié: (2026)

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
par: Slot, Lucas, et autres
Publié: (2024)

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

ZOBA: An Efficient Single-loop Zeroth-order Bilevel Optimization Algorithm
par: Rando, Marco, et autres
Publié: (2026)

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

Piecewise SOS-Convex Moment Optimization and Applications via Exact Semi-Definite Programs
par: Huang, Queenie Yingkun, et autres
Publié: (2024)

A more efficient reformulation of complex SDP as real SDP
par: Wang, Jie
Publié: (2023)

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

Separable QCQPs and Their Exact SDP Relaxations
par: Kojima, Masakazu, et autres
Publié: (2026)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
par: Kojima, Masakazu, et autres
Publié: (2025)

Sparse convex relaxations in polynomial optimization
par: Averkov, Gennadiy, et autres
Publié: (2024)

Outer Approximation Scheme for Weakly Convex Constrained Optimization Problems
par: Bednarczuk, Ewa M., et autres
Publié: (2024)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
par: Kojima, Masakazu, et autres
Publié: (2025)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
par: Qu, Zheng, et autres
Publié: (2023)

A sensitivity-based method for bilevel optimization problems: Theoretical analysis and computational performance
par: Nolasco, Eduardo, et autres
Publié: (2025)

An extension of an RLT-based solver to MINLP polynomial problems
par: González-Díaz, Julio, et autres
Publié: (2024)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
par: González-Díaz, Julio, et autres
Publié: (2025)

Zeroes and Extrema of Functions via Random Measures
par: Micheas, Athanasios Christou
Publié: (2025)

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

An Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c
par: Fujii, Koichi, et autres
Publié: (2023)

A parameter-free approach for solving SOS-convex semi-algebraic fractional programs
par: Yang, Chengmiao, et autres
Publié: (2024)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
par: Arima, Naohiko, et autres
Publié: (2023)

A Surrogate Value Function Formulation for Bilevel Optimization
par: Xu, Mengwei, et autres
Publié: (2025)

The link between $1$-norm approximation and effective Positivstellensatze for the hypercube
par: de Klerk, Etienne, et autres
Publié: (2024)

Duality attainment and strict feasibility of the generalized moment problem and its relaxations
par: Halaseh, Sami, et autres
Publié: (2026)

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
par: Namchaisiri, Charles, et autres
Publié: (2024)

Optimality Conditions and Duality for Multiobjective Fractional Bilevel Optimization Problems
par: Lara, Felipe, et autres
Publié: (2025)

Derivative-Free Bilevel Optimization with Inexact Lower-Level Solutions
par: Cesaroni, Edoardo, et autres
Publié: (2026)

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
par: Namchaisiri, Charles, et autres
Publié: (2024)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
par: Marumo, Hiroki, et autres
Publié: (2024)