Reducing transformation and global optimization
DOI10.1016/J.AMC.2011.11.053zbMATH Open1256.65054OpenAlexW2060085572MaRDI QIDQ434589FDOQ434589
Authors: Djaouida Guettal, Abdelkader Ziadi 
Publication date: 16 July 2012
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.11.053
Recommendations
- Reducing transformations and global optimization
- Alienor method for global optimization with a large number of variables
- A new reducing transformation for global optimization (with Alienor method)
- A New Method for Global Optimisation (Alienor)
- Global optimization: A new variant of the Alienor method
dimension reductionglobal optimizationconstrained optimizationnumerical experimentsalienor methodPiyavskii's algorithmreducing transformation
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26)
Cites Work
- scientific article; zbMATH DE number 3833220 (Why is no real title available?)
- A New Method for Global Optimisation (Alienor)
- A Sequential Method Seeking the Global Maximum of a Function
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- A new extension of Piyavskii's method to Hölder functions of several variables
- A revised cut-peak function method for box constrained continuous global optimization
- Approximation of a several variables function by a one variable function and application to global optimization
- Characterization and generation of \(\alpha\)-dense curves
- Functional equations generating space-densifying curves
- Generation of α‐dense curves in a cube of IRn
- Generation of α‐dense curves and application to global optimization
- Global optimization of generalized linear fractional programming with nonlinear constraints
- Global optimization: A new variant of the Alienor method
- Global optimization: the Alienor mixed method with Piyavskii‐Shubert technique
- Improved versions of the LEDE algorithm for constrained global optimization
- Parallel global optimization of functions of several variables
- Parallelization of the global extremum searching process
- Space-filling curves
- Stopping rules for box-constrained stochastic global optimization
- The existence of α‐dense curves with minimal length in a metric space
Cited In (11)
- A new trisection method for solving Lipschitz bi-objective optimization problems
- A dimensionality reduction principle on the optimization of function
- Reducing transformations and global optimization
- Efficient \(\alpha\)-dense curve strategies for multiple integrals over hyper-rectangle regions
- Global optimization method of multivariate non-Lipschitz functions using tangent minorants
- A new reducing transformation for global optimization (with Alienor method)
- Reducing dimension in global optimization
- A mixed algorithm for smooth global optimization
- NEWS IDEAS FOR SOLVING OPTIMIZATION PROBLEMS RELATED TO OPTIMAL THERAPEUTICS
- Continuous global optimization through the generation of parametric curves
- Generating \(\alpha \)-dense curves in non-convex sets to solve a class of non-smooth constrained global optimization
This page was built for publication: Reducing transformation and global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q434589)
