New classes of globally convexized filled functions for global optimization
From MaRDI portal
Publication:1812075
DOI10.1023/A:1020243720794zbMath1047.90051OpenAlexW1489476537MaRDI QIDQ1812075
Stefano Lucidi, Veronica Piccialli
Publication date: 18 June 2003
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1020243720794
Related Items
A new parameter free filled function for solving unconstrained global optimization problems, A new filled function for global minimization and system of nonlinear equations, A novel filled function method and quasi-filled function method for global optimization, Two-parameters quasi-filled function algorithm for nonlinear integer programming, Unification of filled function and tunnelling function in global optimization, A Class of Parameter-Free Filled Functions for Unconstrained Global Optimization, Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems, New global optimization methods for ship design problems, A integral filter algorithm for unconstrained global optimization, Discrete global optimization problems with a modified discrete filled function, Finding global minima with an inflection point-based filled function algorithm, A novel one-parameter filled function method with an application to pathological analysis, Simple transformation functions for finding better minima, An approach to solve local and global optimization problems based on exact objective filled penalty functions, A filled function method for constrained global optimization, A new filled function method with two parameters for global optimization, A new filled function method for global optimization, A filling function method for unconstrained global optimization, A new filled function method for unconstrained global optimization, A new auxiliary function method for general constrained global optimization, An integral function and vector sequence method for unconstrained global optimization, Global descent methods for unconstrained global optimization, A filled function method for finding a global minimizer on global integer optimization, A new filled function method for constrained nonlinear equations, A gradually descent method for discrete global optimization, New modified function method for global optimization, Modified Filled Function Method for Resolving Nonlinear Integer Programming Problem, A revised cut-peak function method for box constrained continuous global optimization, A filled function method for global optimization with inequality constraints, Minimum-time spacecraft attitude motion planning using objective alternation in derivative-free optimization, Global optimization based on local searches, Global optimization based on local searches, Global optimization of protein-peptide docking by a filling function method
Uses Software
