New technique for solving multivariate global optimization

DOI10.33993/JNAAT521-1287MaRDI QIDQ6966055zbMATH OpenFDO

Authors Djamel Aaid, Özen Özer

Publication date 30 June 2025

Published in Journal of Numerical Analysis and Approximation Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.33993/JNAAT521-1287

Mathematics Subject Classification ID

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

Cites work

• A combined descent gradient method and discretization method for convex SIP
• A modified classical algorithm ALPT4C for solving a capacitated four-index transportation problem
• A new approach for nonconvex SIP
• A practical guide to splines
• Alienor method for global optimization with a large number of variables
• Alienor, fractal algorithm for multivariable minimization problems
• Computational experience with a new class of convex underestimators: Box-constrained NLP problems
• Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
• New quadratic lower bound for multivariate functions in global optimization
• Reducing transformation and global optimization
• The main diagonal method in C^1 global optimization problem
• Trigonometric convex underestimator for the base functions in Fourier space

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

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