New technique for solving univariate global optimization.

DOI10.5817/AM2017-1-19MaRDI QIDQ5270946zbMATH OpenOpenAlexFDO

Authors Djamel Aaid, Amel Noui, Mohand Ouanes

Publication date 3 July 2017

Published in Archivum Mathematicum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5817/am2017-1-19

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

branch-and-bound methodconvex underestimationglobal optimizationpiecewise quadratic

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A new global optimization method for univariate constrained twice-differentiable NLP problems
• Combination of two underestimators for univariate global optimization
• New underestimator for univariate global optimization
• Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
• A new global optimization technique by auxiliary function method in a directional search

Cited in

(7)

• A deterministic approach to global box-constrained optimization
• Piecewise quadratic bounding functions for finding real roots of polynomials
• New quadratic lower bound for multivariate functions in global optimization
• A new global optimization technique by auxiliary function method in a directional search
• The main diagonal method in C^1 global optimization problem
• New underestimator for univariate global optimization
• A new global optimization method for univariate constrained twice-differentiable NLP problems

This page was built for publication: New technique for solving univariate global optimization.

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