Cover Image

A Tight SDP Relaxation for the Cubic-Quartic Regularization Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhou, Jinling, Liu, Xin, Nie, Jiawang, Tang, Xindong
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Sparse Copositive Polynomial Optimization
by: Zhong, Suhan, et al.
Published: (2026)

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

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

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

Sparse Polynomial Optimization with Matrix Constraints
by: Nie, Jiawang, et al.
Published: (2024)

Log-Polynomial Optimization
by: Choi, Jiyoung, et al.
Published: (2026)

An SDP Relaxation for the Sparse Integer Least Squares Problem
by: Del Pia, Alberto, et al.
Published: (2022)

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

Tight SDP relaxations for cardinality-constrained problems
by: Wiegele, Angelika, et al.
Published: (2021)

On the Exactness of SDP Relaxation for Quadratic Assignment Problem
by: Ling, Shuyang
Published: (2024)

A Randomized Algorithm for Sparse PCA based on the Basic SDP Relaxation
by: Del Pia, Alberto, et al.
Published: (2025)

RiNNAL+: a Riemannian ALM Solver for SDP-RLT Relaxations of Mixed-Binary Quadratic Programs
by: Hou, Di, et al.
Published: (2025)

Tightness of SDP and Burer-Monteiro Factorization for Phase Synchronization in High-Noise Regime
by: Zhang, Anderson Ye
Published: (2025)

On the SDP Relaxation of Direct Torque Finite Control Set Model Predictive Control
by: Hartmann, Luca M., et al.
Published: (2024)

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

Approximating Dispatchable Regions in Three-Phase Radial Networks with Conditions for Exact SDP Relaxation
by: Fang, Bohang, et al.
Published: (2025)

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

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

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

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

Max-Min Bilinear Completely Positive Programs: A Semidefinite Relaxation with Tightness Guarantees
by: Gao, Sarah Yini, et al.
Published: (2026)

Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum
by: Wang, Bofan, et al.
Published: (2024)

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

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

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

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

Tensor Based Proximal Alternating Minimization Method for A Kind of Inhomogeneous Quartic Optimization Problem
by: Chen, Haibin, et al.
Published: (2025)

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

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

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

Reliable Solution to Dynamic Optimization Problems using Integrated Residual Regularized Direct Collocation
by: Nie, Yuanbo, et al.
Published: (2025)

An Adaptive Cubic Regularization quasi-Newton Method on Riemannian Manifolds
by: Louzeiro, Mauricio S., et al.
Published: (2024)

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

Connecting Max-entropy With Computational Geometry, LP And SDP
by: Lasserre, Jean B
Published: (2026)

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

Global Optimality Characterizations and Algorithms for Minimizing Quartically-Regularized Third-Order Taylor Polynomials
by: Zhu, Wenqi, et al.
Published: (2025)

Regularization in Data-driven Predictive Control: A Convex Relaxation Perspective
by: Shang, Xu, et al.
Published: (2025)

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

Constructing Tight Quadratic Relaxations for Global Optimization: II. Underestimating Difference-of-Convex (D.C.) Functions
by: Strahl, William R., et al.
Published: (2024)

Constructing Tight Quadratic Relaxations for Global Optimization: I. Outer-Approximating Twice-Differentiable Convex Functions
by: Strahl, William R., et al.
Published: (2024)