Cover Image

A parameter-free approach for solving SOS-convex semi-algebraic fractional programs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yang, Chengmiao, Jiao, Liguo, Lee, Jae Hyoung
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C32, 90C22, 90C23
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

Edge expansion of a graph: SDP-based computational strategies
by: Gupte, Akshay, et al.
Published: (2024)

Sparse Polynomial Optimization with Unbounded Sets
by: Huang, Lei, et al.
Published: (2024)

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

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

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

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

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

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

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

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

Sparse Polynomial Matrix Optimization
by: Miller, Jared, et al.
Published: (2024)

Computational complexity of sum-of-squares bounds for copositive programs
by: Palomba, Marilena, et al.
Published: (2025)

A preconditioned augmented Lagrangian method for solving semidefinite programming problems
by: Tang, Tianyun, et al.
Published: (2026)

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

Sum-of-squares certificates for symmetric polynomials on the hypercube: a counterexample to a conjecture of De Klerk and Laurent
by: Polak, Sven
Published: (2026)

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

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

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

Dual certificates of primal cone membership
by: Lee, Joonyeob, et al.
Published: (2025)

A polynomially solvable case of unconstrained (-1,1)-quadratic fractional optimization
by: Yang, Meijia, et al.
Published: (2024)

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

Interior-point algorithms with full Newton steps for nonsymmetric convex conic optimization
by: Papp, Dávid, et al.
Published: (2025)

An ODE approach to multiple choice polynomial programming
by: Shao, Sihong, et al.
Published: (2022)

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

Semidefinite approximations for bicliques and biindependent pairs
by: Laurent, Monique, et al.
Published: (2023)

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

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

A squared smoothing Newton method for semidefinite programming
by: Liang, Ling, et al.
Published: (2023)

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

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

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

Closing the duality gap of the generalized trace ratio problem
by: Yang, Meijia, et al.
Published: (2024)

A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
by: Hou, Di, et al.
Published: (2025)

Moment-sos and spectral hierarchies for polynomial optimization on the sphere and quantum de Finetti theorems
by: Blomenhofer, Alexander Taveira, et al.
Published: (2024)

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