Tangencies and polynomial optimization

DOI10.1007/s10107-022-01869-6zbMath1525.90326arXiv1902.06041WikidataQ114228468 ScholiaQ114228468MaRDI QIDQ6038670

Tiên Sȯn Phạm

Publication date: 2 May 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

stabilitycoercivityboundednesscritical pointscompactnesspolynomialexistence of minimizerstangenciessemi-algebraicsub-levels

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Real algebraic sets (14P05) Semialgebraic sets and related spaces (14P10) Polynomial optimization (90C23)

Related Items (1)

Homogenization for polynomial optimization with unbounded sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On polynomial optimization over non-compact semi-algebraic sets
• Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
• On the limit set at infinity of a gradient trajectory of a semialgebraic function
• Solving polynomial optimization problems via the truncated tangency variety and sums of squares
• Bifurcation sets of functions definable in \(o\)-minimal structures
• Geometric categories and o-minimal structures
• On the complexity of testing attainment of the optimal value in nonlinear optimization
• On the existence of Pareto solutions for polynomial vector optimization problems
• Minimizing polynomials via sum of squares over the gradient ideal
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• An Introduction to Polynomial and Semi-Algebraic Optimization
• Genericity in Polynomial Optimization
• Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets
• Local Minimizers of Semi-Algebraic Functions from the Viewpoint of Tangencies
• On the Łojasiewicz exponent at infinity of real polynomials
• Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares
• Class of global minimum bounds of polynomial functions
• The Generic Nature of Optimality Conditions in Nonlinear Programming
• Semi-Algebraic Local-Triviality in Semi-Algebraic Mappings
• First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
• Coercive polynomials: stability, order of growth, and Newton polytopes
• Coercive Polynomials and Their Newton Polytopes
• Proof of the gradient conjecture of R. Thom.

This page was built for publication: Tangencies and polynomial optimization