A new heuristic approach for non-convex optimization problems

DOI10.1016/j.ins.2009.12.028zbMath1198.90331OpenAlexW2009061246MaRDI QIDQ985056

Rosario Toscano, Patrick Lyonnet

Publication date: 20 July 2010

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2009.12.028

zbMATH Keywords

almost sure convergenceobjective functionmetaheuristicnon-convex optimizationheuristic Kalman algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems ⋮ Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions ⋮ Robust PID controller tuning based on the heuristic Kalman algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Ant colony optimization for continuous domains
• A tabu search approach for the minimum sum-of-squares clustering problem
• Stochastic models, estimation, and control. Vol. 1
• Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
• Design of mixed \(\mathcal H_{2}/\mathcal H_{\infty}\) control systems using algorithms inspired by the immune system
• Robust PID controller tuning based on the constrained particle swarm optimization
• A study of particle swarm optimization particle trajectories
• Random optimization
• Lagrange Multipliers and Optimality
• Enhanced simulated annealing for globally minimizing functions of many-continuous variables
• A continuous genetic algorithm designed for the global optimization of multimodal functions

This page was built for publication: A new heuristic approach for non-convex optimization problems