A note on optimization with Morse polynomials

DOI10.4134/CKMS.C170221MaRDI QIDQ4582718zbMATH OpenFDO

Authors Lê Công-Trình

Publication date 24 August 2018

Full work available at URL https://arxiv.org/abs/1703.00755

zbMATH Keywords

gradient idealMilnor numberMorse polynomialnon-degenerate critical pointpolynomial optimization

Mathematics Subject Classification ID

Sums of squares and representations by other particular quadratic forms (11E25) Singularities in algebraic geometry (14B05) Singularities of curves, local rings (14H20) Semialgebraic sets and related spaces (14P10) Semidefinite programming (90C22)

Abstract: In this paper we prove that the gradient ideal of a Morse polynomial is radical. This gives a generic class of polynomials whose gradient ideals are radical. As a consequence we reclaim a previous result that the unconstrained polynomial optimization problem for Morse polynomials has a finite convergence.

Recommendations

• Nonnegative Morse polynomial functions and polynomial optimization
• Representations of positive polynomials and optimization on noncompact semialgebraic sets
• Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
• Minimizing polynomials via sum of squares over the gradient ideal
• Optimization of Polynomial Functions

Cites work

• Algorithms in real algebraic geometry
• Global optimization with polynomials and the problem of moments
• scientific article; zbMATH DE number 51597 (Why is no real title available?)
• scientific article; zbMATH DE number 1206418 (Why is no real title available?)
• scientific article; zbMATH DE number 1489808 (Why is no real title available?)
• scientific article; zbMATH DE number 2200453 (Why is no real title available?)
• Introduction to Singularities and Deformations
• Minimizing polynomials via sum of squares over the gradient ideal
• Nonnegative Morse polynomial functions and polynomial optimization

Cited in

(4)

• Neural network with smooth activation functions and without bottlenecks is almost surely a Morse function
• Absence of bottlenecks in a neural network determines its generic functional properties
• Nonnegative Morse polynomial functions and polynomial optimization
• Computing Optimal Discrete Morse Functions

Describes a project that uses

Uses Software

• RAGlib

This page was built for publication: A note on optimization with Morse polynomials

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