The oracle penalty method

DOI10.1007/s10898-009-9477-0zbMath1190.90219OpenAlexW2050045401MaRDI QIDQ975775

Matthias Gerdts, Martin Schlüter

Publication date: 11 June 2010

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-009-9477-0

zbMATH Keywords

constrained optimizationpenalty functionmixed integer nonlinear programmingant colony optimizationMIDACO-Solverstochastic metaheuristic

Mathematics Subject Classification ID

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

Related Items (7)

A numerical study of MIDACO on 100 MINLP benchmarks ⋮ Scheduled penalty variable neighborhood search ⋮ PyOpt: a python-based object-oriented framework for nonlinear constrained optimization ⋮ An improved test set approach to nonlinear integer problems with applications to engineering design ⋮ A genetic algorithm based augmented Lagrangian method for constrained optimization ⋮ Optimization by ant algorithms: possible roles for an individual ant ⋮ Review and comparison of algorithms and software for mixed-integer derivative-free optimization

Uses Software

• MIDACO
• Scatter Search
• MISQP
• Mintoc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Ant colony optimization for continuous domains
• Scatter search for chemical and bio-process optimization
• Extended ant colony optimization for non-convex mixed integer nonlinear programming
• A collection of test problems for constrained global optimization algorithms
• Handbook of test problems in local and global optimization
• Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
• Computational method for time-optimal switching control
• A trust region SQP algorithm for mixed-integer nonlinear programming
• A comparative study on optimization methods for the constrained nonlinear programming problems
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• A Genetic Algorithm for the Multiple-Choice Integer Program
• A computational comparison of some non-linear programs

This page was built for publication: The oracle penalty method