On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Real and complex fields (12Dxx)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Global convergence of a proximal linearized algorithm for difference of convex functions
Testing copositivity with the help of difference-of-convex optimization
An efficient DC programming approach for portfolio decision with higher moments
A convex polynomial that is not sos-convex
On functions representable as a difference of convex functions
Moments and sums of squares for polynomial optimization and related problems
Semidefinite representation of convex sets
A semidefinite programming approach to the generalized problem of moments
A tutorial on geometric programming
Convex analysis approach to d. c. programming: Theory, algorithms and applications
Semidefinite programming relaxations for semialgebraic problems
Über die Darstellung definiter Formen als Summe von Formenquadraten.
An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
A proximal difference-of-convex algorithm with extrapolation
DC programming and DCA: thirty years of developments
DC decomposition of nonconvex polynomials with algebraic techniques
Accelerating the DC algorithm for smooth functions
Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
NP-hardness of deciding convexity of quartic polynomials and related problems
Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem
Discrete dynamical system approaches for Boolean polynomial optimization
An inertial algorithm for DC programming
Variations and extension of the convex-concave procedure
A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
Global optimization with polynomials and the problem of moments
A complete characterization of the gap between convexity and sos-convexity
Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
Computing B-Stationary Points of Nonsmooth DC Programs
DC Programming and DCA for General DC Programs
Some NP-complete problems in quadratic and nonlinear programming
A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
CSDP, A C library for semidefinite programming
Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
The Euclidian Distance Matrix Completion Problem
Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming
DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
Convex analysis and global optimization
A Convex Form That Is Not a Sum of Squares

This page was built for publication: On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550977)