Cross-Hill: a heuristic method for global optimization

DOI10.1016/j.amc.2015.06.013zbMath1410.90281OpenAlexW2170639591MaRDI QIDQ669439

Deren Han, Yi Xu, Tingting Wu

Publication date: 15 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2015.06.013

zbMATH Keywords

tensorglobal optimizationgradient descent methodpolynomial optimizationlocal methodCross-Hill

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Two-stage image segmentation based on nonconvex \(\ell_2-\ell_p\) approximation and thresholding

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• A cone constrained convex program: structure and algorithms
• Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces
• Portfolio management with heuristic optimization.
• Z-eigenvalue methods for a global polynomial optimization problem
• Semidefinite programming relaxations for semialgebraic problems
• Eigenvalues of a real supersymmetric tensor
• Rank and eigenvalues of a supersymmetric tensor, the multivariate homogeneous polynomial and the algebraic hypersurface it defines
• Optimization theory and methods. Nonlinear programming
• A successive approximation method for quantum separability
• Global Optimization with Polynomials and the Problem of Moments
• On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
• Projected gradient methods for linearly constrained problems
• Testing Unconstrained Optimization Software
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors