Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials

DOI10.1007/s10107-020-01536-8zbMath1494.65039arXiv1912.00332OpenAlexW3040026369MaRDI QIDQ2230937

C. Yalçın Kaya, Regina Sandra Burachik

Publication date: 29 September 2021

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

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

zbMATH Keywords

global optimizationtrajectory methodsmultivariate quartic polynomialSteklov convexificationSteklov smoothing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical methods of relaxation type (49M20)

Related Items (2)

A generalized multivariable Newton method ⋮ Special issue: Continuous optimization and stability analysis

Uses Software

• SFSDP

Cites Work

• Unnamed Item
• Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
• Solution to global minimization of polynomials by backward differential flow
• On polynomial optimization over non-compact semi-algebraic sets
• Subdifferentials of the first and second orders for Lipschitz functions
• Smoothing methods for nonsmooth, nonconvex minimization
• Sum of squares method for sensor network localization
• ``Backward differential flow may not converge to a global minimizer of polynomials
• A reassessment of the Snyman-Fatti dynamic search trajectory method for unconstrained global optimization
• Multivariate polynomial minimization and its application in signal processing
• Optimality conditions and optimization methods for quartic polynomial optimization
• Improved approximation results on standard quartic polynomial optimization
• Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints
• Fast rank-one alternating minimization algorithm for phase retrieval
• Steklov regularization and trajectory methods for univariate global optimization
• Convergence rates for forward-backward dynamical systems associated with strongly monotone inclusions
• Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
• Extrema of a real polynomial
• Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
• Algorithm 920
• A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
• Global Minimization of Normal Quartic Polynomials Based on Global Descent Directions
• The Minimization of Semicontinuous Functions: Mollifier Subgradients
• Deterministic Global Optimization
• Blind constant modulus equalization via convex optimization

This page was built for publication: Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials