Global descent method for constrained continuous global optimization

DOI10.1016/j.amc.2014.06.089zbMath1335.90073OpenAlexW2042087590MaRDI QIDQ278323

Amine Ketfi-cherif, Abdelkader Ziadi

Publication date: 2 May 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.06.089

zbMATH Keywords

global descent methodmodified function approachesnonsmooth nonconvex constraintsnonsmooth nonconvex optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (4)

A new global optimization technique by auxiliary function method in a directional search ⋮ Existence and discrete approximation for optimization problems governed by fractional differential equations ⋮ A deterministic method for continuous global optimization using a dense curve ⋮ On a new smoothing technique for non-smooth, non-convex optimization

Uses Software

• CARTopt

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• CARTopt: a random search method for nonsmooth unconstrained optimization
• A filled function method with one parameter for unconstrained global optimization
• Global descent methods for unconstrained global optimization
• A new filled function algorithm for constrained global optimization problems
• A filled function method applied to nonsmooth constrained global optimization
• A filled function method for finding a global minimizer of a function of several variables
• A one-parameter filled function method applied to nonsmooth constrained global optimization
• Extension of Piyavskii's algorithm to continuous global optimization
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• A numerical comparison of some modified controlled random search algorithms
• A sequential convexification method (SCM) for continuous global optimization
• The globally convexized filled functions for global optimization
• The impelling function method applied to global optimization
• A new extension of Piyavskii's method to Hölder functions of several variables
• Global Descent Method for Global Optimization
• The Tunneling Algorithm for the Global Minimization of Functions
• A new auxiliary function method for general constrained global optimization
• Convex analysis and global optimization
• A new filled function method for unconstrained global optimization
• Introduction to global optimization.
• Filled functions for unconstrained global optimization.

This page was built for publication: Global descent method for constrained continuous global optimization