On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials
type: Item
instance of: scholarly article
title: On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials
author: Yi-Shuai Niu
author: Le Thi Hoai An
author: Pham Dinh Tao
published in: SIAM Journal on Optimization
publication date: 2024-06-05T00:00:00Z
Mathematics Subject Classification ID: 12Dxx
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7860641
zbMATH Keywords: difference-of-sums-of-squares
zbMATH Keywords: convex-sums-of-squares
zbMATH Keywords: difference-of-convex-sums-of-squares
zbMATH Keywords: polynomial optimization
zbMATH Keywords: DC programming
MaRDI profile type: MaRDI publication profile
cites work: DC decomposition of nonconvex polynomials with algebraic techniques
cites work: DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
cites work: NP-hardness of deciding convexity of quartic polynomials and related problems
cites work: A complete characterization of the gap between convexity and sos-convexity
cites work: A convex polynomial that is not sos-convex
cites work: Accelerating the DC algorithm for smooth functions
cites work: The Euclidian Distance Matrix Completion Problem
cites work: Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
cites work: Q3102800
cites work: Q2751334
cites work: CSDP, A C library for semidefinite programming
cites work: A tutorial on geometric programming
cites work: An inertial algorithm for DC programming
cites work: Testing copositivity with the help of difference-of-convex optimization
cites work: Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
cites work: On functions representable as a difference of convex functions
cites work: Semidefinite representation of convex sets
cites work: Über die Darstellung definiter Formen als Summe von Formenquadraten.
cites work: A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
cites work: Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
cites work: Global optimization with polynomials and the problem of moments
cites work: A semidefinite programming approach to the generalized problem of moments
cites work: Moments and sums of squares for polynomial optimization and related problems
cites work: An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
cites work: DC Programming and DCA for General DC Programs
cites work: DC programming and DCA: thirty years of developments
cites work: Variations and extension of the convex-concave procedure
cites work: Some NP-complete problems in quadratic and nonlinear programming
cites work: Discrete dynamical system approaches for Boolean polynomial optimization
cites work: Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming
cites work: Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem
cites work: Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
cites work: Computing B-Stationary Points of Nonsmooth DC Programs
cites work: Q4279211
cites work: Semidefinite programming relaxations for semialgebraic problems
cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications
cites work: A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
cites work: An efficient DC programming approach for portfolio decision with higher moments
cites work: Q4496287
cites work: A Convex Form That Is Not a Sum of Squares
cites work: Global convergence of a proximal linearized algorithm for difference of convex functions
cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
cites work: Convex analysis and global optimization
cites work: A proximal difference-of-convex algorithm with extrapolation
DOI: 10.1137/22M1495524
description: scientific article; zbMATH DE number 7860641