Imagen de Portada

Sparse Polynomial Optimization with Matrix Constraints

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Nie, Jiawang, Qu, Zheng, Tang, Xindong, Zhang, Linghao
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Characterization for Tightness of the Sparse Moment-SOS Hierarchy
por: Nie, Jiawang, et al.
Publicado: (2024)

Sparse Copositive Polynomial Optimization
por: Zhong, Suhan, et al.
Publicado: (2026)

Polynomial Optimization Over Unions of Sets
por: Nie, Jiawang, et al.
Publicado: (2024)

Log-Polynomial Optimization
por: Choi, Jiyoung, et al.
Publicado: (2026)

Learning Polynomial Activation Functions for Deep Neural Networks
por: Zhang, Linghao, et al.
Publicado: (2025)

Distributionally Robust Optimization with Polynomial Robust Constraints
por: Nie, Jiawang, et al.
Publicado: (2023)

Polynomial Optimization Relaxations for Generalized Semi-Infinite Programs
por: Hu, Xiaomeng, et al.
Publicado: (2023)

A Tight SDP Relaxation for the Cubic-Quartic Regularization Problem
por: Zhou, Jinling, et al.
Publicado: (2025)

Rank One Completion for Higher Order Tensors
por: Zhang, Linghao, et al.
Publicado: (2026)

Robust Completion for Rank-1 Tensors with Noises
por: Nie, Jiawang, et al.
Publicado: (2025)

Towards Global Solutions for Nonconvex Two-Stage Stochastic Programs: A Polynomial Lower Approximation Approach
por: Zhong, Suhan, et al.
Publicado: (2023)

Optimization over the weakly Pareto set and multi-task learning
por: Huang, Lei, et al.
Publicado: (2025)

Partial Lagrange Multiplier Expressions and Disjunctive Decompositions for Bilevel Optimization
por: Nie, Jiawang, et al.
Publicado: (2023)

Finite convergence of the Moment-SOS hierarchy for polynomial matrix optimization
por: Huang, Lei, et al.
Publicado: (2024)

Generalized Nash equilibrium problems with quasi-linear constraints
por: Choi, Jiyoung, et al.
Publicado: (2024)

Moment-SOS relaxations for moment and tensor recovery problems
por: Huang, Lei, et al.
Publicado: (2024)

A global approach for generalized semi-infinte programs with polyhedral parameter sets
por: Hu, Xiaomeng, et al.
Publicado: (2025)

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

Finite convergence of Moment-SOS relaxations with non-real radical ideals
por: Huang, Lei, et al.
Publicado: (2023)

Sparse Polynomial Matrix Optimization
por: Miller, Jared, et al.
Publicado: (2024)

Completely Positive Reformulations of Polynomial Optimization Problems with Linear Inequality Constraints
por: Chen, Haibin, et al.
Publicado: (2026)

The Rank-1 Completion Problem for Cubic Tensors
por: Zhou, Jinling, et al.
Publicado: (2024)

Lagrange multiplier expressions for matrix polynomial optimization and tight relaxations
por: Huang, Lei, et al.
Publicado: (2025)

Sparse Polynomial Regression under Anomalous Data
por: Abolpour, Roozbeh, et al.
Publicado: (2025)

Verifying Properties of Binary Neural Networks Using Sparse Polynomial Optimization
por: Yang, Jianting, et al.
Publicado: (2024)

Efficient Low Rank Matrix Recovery With Flexible Group Sparse Regularization
por: Yu, Quan, et al.
Publicado: (2024)

Spectral Methods for Polynomial Optimization
por: Moreno, Elvira, et al.
Publicado: (2025)

Harmonic Hierarchies for Polynomial Optimization
por: Cristancho, Sergio, et al.
Publicado: (2022)

Zeroth-Order Feedback Optimization in Multi-Agent Systems: Tackling Coupled Constraints
por: Duan, Yingpeng, et al.
Publicado: (2024)

Proximal Iterative Hard Thresholding Algorithm for Sparse Group $\ell_0$-Regularized Optimization with Box Constraint
por: Ye, Yuge, et al.
Publicado: (2025)

Existence of Solutions for the Continuous Algebraic Riccati Equation via Polynomial Optimization
por: Zhang, Juan, et al.
Publicado: (2024)

Accelerated Proximal Dogleg Majorization for Sparse Regularized Quadratic Optimization Problem
por: Zhao, Feifei, et al.
Publicado: (2025)

On Approximation Algorithms for Commutative Quaternion Polynomial Optimization
por: He, Chang, et al.
Publicado: (2025)

A Certificate of Unboundedness for Polynomial Optimization Problems
por: Rele, Rohan, et al.
Publicado: (2026)

Sparse Hyperparametric Itakura-Saito Nonnegative Matrix Factorization via Bi-Level Optimization
por: Selicato, Laura, et al.
Publicado: (2025)

One-Sided Matrix Completion from Ultra-Sparse Samples
por: Zhang, Hongyang R., et al.
Publicado: (2026)

Optimization with Parametric Variational Inequality Constraints on a Moving Set
por: Chen, Xiaojun, et al.
Publicado: (2026)

S-SOS: Stochastic Sum-Of-Squares for Parametric Polynomial Optimization
por: Zhu, Richard L., et al.
Publicado: (2024)

An Efficient Framework for Global Non-Convex Polynomial Optimization with Algebraic Constraints
por: Harris, Mitchell Tong, et al.
Publicado: (2023)

Tight Bounds on Polynomials and Its Application to Dynamic Optimization Problems
por: Vila, Eduardo M. G., et al.
Publicado: (2024)