Simulated annealing with asymptotic convergence for nonlinear constrained optimization
From MaRDI portal
Publication:946337
DOI10.1007/s10898-006-9107-zzbMath1152.90010MaRDI QIDQ946337
Yixin Chen, Tao Wang, Benjamin W.-S. Wah
Publication date: 23 September 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9107-z
simulated annealing; nonlinear constrained optimization; asymptotic convergence; constrained local minimum; constraint partitioning; dynamic penalty methods; extended saddle points
90C30: Nonlinear programming
90C59: Approximation methods and heuristics in mathematical programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- Optimization by Simulated Annealing
- Constraint partitioning in penalty formulations for solving temporal planning problems
- Efficient synthesis of out-of-core algorithms using a nonlinear optimization solver
- Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
- Convergence and finite-time behavior of simulated annealing
- Simulated annealing methods with general acceptance probabilities
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
- A Genetic Algorithm for the Multiple-Choice Integer Program
- CUTE
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Cycle Decompositions and Simulated Annealing
- Non-Linear Programming Via Penalty Functions
- Exact penalty functions in nonlinear programming
