New quadratic lower bound for multivariate functions in global optimization

DOI10.1016/J.MATCOM.2014.04.013MaRDI QIDQ2228598zbMATH OpenOpenAlexFDO

Authors Mohand Ouanes, Le Thi Hoai An, Trong Phuc Nguyen, A. Zidna

Publication date 19 February 2021

Published in Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.matcom.2014.04.013

zbMATH Keywords

global optimizationbranch and boundlinear and quadratic underestimation

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Recommendations

• scientific article; zbMATH DE number 221928
• An algorithm for global minimization of linearly constrained quadratic functions
• A multivariate global optimization using linear bounding functions
• New technique for solving univariate global optimization.
• Performance of convex underestimators in a branch-and-bound framework

Cites work

• scientific article; zbMATH DE number 1304342 (Why is no real title available?)
• A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
• A global optimization algorithm for multivariate functions with Lipschitzian first derivatives
• A multivariate global optimization using linear bounding functions
• A practical guide to splines
• A review of recent advances in global optimization
• Computing the range of values of real functions using B-spline form
• Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
• Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
• Global optimization of Hölder functions
• Global optimization using interval analysis - the multi-dimensional case
• Handbook of global optimization
• Lower bound functions for polynomials
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Rigorous convex underestimators for general twice-differentiable problems
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems

Cited in

(7)

• New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
• New underestimator for univariate global optimization
• Efficient IBS from a new assumption in the multivariate-quadratic setting
• Piecewise quadratic bounding functions for finding real roots of polynomials
• A mixed algorithm for smooth global optimization
• Combination of two underestimators for univariate global optimization
• Tighter convex underestimator for general twice differentiable function for global optimization

This page was built for publication: New quadratic lower bound for multivariate functions in global optimization

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