☆ 4.0 Article

Duality of sum of nonnegative circuit polynomials and optimal SONC bounds

JOURNAL OF SYMBOLIC COMPUTATION (2023)

相关参考文献

注意：仅列出部分参考文献，下载原文获取全部文献信息。

Article Computer Science, Interdisciplinary Applications

Alfonso: Matlab Package for Nonsymmetric Conic Optimization

David Papp et al.

Summary: The paper introduces an open-source Matlab package called alfonso for solving conic optimization problems over nonsymmetric convex cones. This software is unique in that it allows optimization over any convex cone as long as a suitable barrier function is available, expanding the range of applicable cones compared to other conic optimization software. Furthermore, it offers comparable efficiency to state-of-the-art interior-point methods for symmetric cones and can outperform existing software for problems with specific characteristics that can be leveraged in barrier computation.

INFORMS JOURNAL ON COMPUTING (2022)

添加到收藏夹

Article Mathematics, Applied

A UNIFIED FRAMEWORK OF SAGE AND SONG POLYNOMIALS AND ITS DUALITY THEORY

Lukas Katthan et al.

Summary: This paper introduces and studies a cone made up of a class of generalized polynomial functions, providing a common framework for non-negativity certificates of polynomials in sparse settings. The dual cone of the S-cone is thoroughly characterized, even for its specializations, and the extreme rays of the S-cone are exactly characterized as well. Additionally, a subclass of functions is provided where non-negativity coincides with membership in the S-cone.

MATHEMATICS OF COMPUTATION (2021)

添加到收藏夹

Article Mathematics, Applied

TSSOS: A MOMENT-SOS HIERARCHY THAT EXPLOITS TERM SPARSITY

Jie Wang et al.

Summary: This paper introduces a new hierarchy of semidefinite programming relaxations for polynomial optimization problems, exploiting the sparsity of input polynomials. The novelty lies in involving block-diagonal matrices obtained through an iterative procedure for completing connected components of certain adjacency graphs. The theoretical framework is then applied to compute lower bounds for polynomial optimization problems.

SIAM JOURNAL ON OPTIMIZATION (2021)

添加到收藏夹

Article Mathematics

The dual cone of sums of non-negative circuit polynomials

Mareike Dressler et al.

Summary: This study presents a representation of the cone of non-negative circuit polynomials sum and derives an optimality criterion for sums of non-negative circuit polynomials in polynomial optimization.

ADVANCES IN GEOMETRY (2021)

添加到收藏夹

Article Computer Science, Theory & Methods

Newton Polytopes and Relative Entropy Optimization

Riley Murray et al.

Summary: Certifying function nonnegativity is a common problem in computational mathematics, with applications in optimization. The study investigates certifying nonnegativity of signomials based on Sums-of-AM/GM-Exponentials decomposition, presenting new structural properties of SAGE certificates. The results expand the class of nonconvex signomial optimization problems that can be efficiently solved via convex relaxation.

FOUNDATIONS OF COMPUTATIONAL MATHEMATICS (2021)

添加到收藏夹

Article Mathematics, Applied

SUM-OF-SQUARES OPTIMIZATION WITHOUT SEMIDEFINITE PROGRAMMING

David Papp et al.

SIAM JOURNAL ON OPTIMIZATION (2019)

添加到收藏夹

Article Mathematics, Applied

A Positivstellensatz for Sums of Nonnegative Circuit Polynomials

Mareike Dressler et al.

SIAM JOURNAL ON APPLIED ALGEBRA AND GEOMETRY (2017)

添加到收藏夹

Article Mathematics, Applied

RELATIVE ENTROPY RELAXATIONS FOR SIGNOMIAL OPTIMIZATION

Venkat Chandrasekaran et al.

SIAM JOURNAL ON OPTIMIZATION (2016)

添加到收藏夹

Article Mathematics

Amoebas, nonnegative polynomials and sums of squares supported on circuits

Sadik Iliman et al.

RESEARCH IN THE MATHEMATICAL SCIENCES (2016)

添加到收藏夹

Article Operations Research & Management Science

On the computational complexity of membership problems for the completely positive cone and its dual

Peter J. C. Dickinson et al.

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2014)

添加到收藏夹

Article Mathematics, Applied

A CUTTING SURFACE ALGORITHM FOR SEMI-INFINITE CONVEX PROGRAMMING WITH AN APPLICATION TO MOMENT ROBUST OPTIMIZATION

Sanjay Mehrotra et al.

SIAM JOURNAL ON OPTIMIZATION (2014)

添加到收藏夹

Article Operations Research & Management Science

Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization

Cordian Riener et al.

MATHEMATICS OF OPERATIONS RESEARCH (2013)

添加到收藏夹

Article Mathematics, Applied

LOWER BOUNDS FOR POLYNOMIALS USING GEOMETRIC PROGRAMMING

Mehdi Ghasemi et al.

SIAM JOURNAL ON OPTIMIZATION (2012)

添加到收藏夹

Article Mathematics, Applied

Convergent SDP-relaxations in polynomial optimization with sparsity

Jean B. Lasserre

SIAM JOURNAL ON OPTIMIZATION (2006)

添加到收藏夹

Article Computer Science, Software Engineering

Sparsity in sums of squares of polynomials

M Kojima et al.

MATHEMATICAL PROGRAMMING (2005)

添加到收藏夹

Article Computer Science, Software Engineering

GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi

D Henrion et al.

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE (2003)

添加到收藏夹

Article Mathematics, Applied

Global optimization with polynomials and the problem of moments

JB Lasserre

SIAM JOURNAL ON OPTIMIZATION (2001)

添加到收藏夹

© Peeref 2019-2024. All rights reserved.