A multi-local optimization algorithm

DOI10.1007/BF02564795zbMath0910.90258OpenAlexW1536900089MaRDI QIDQ1265238

Teresa Leon, S. San Matías, Enriqueta Vercher

Publication date: 28 September 1998

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02564795

zbMATH Keywords

global unconstrained optimizationinexact line searchesmulti-local optimization

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Interval and finite arithmetic (65G30) Semi-infinite programming (90C34)

Related Items (5)

Solving a class of fuzzy linear programs by using semi-infinite programming techniques ⋮ Assessing Basin Identification Methods for Locating Multiple Optima ⋮ On the numerical treatment of linearly constrained semi-infinite optimization problems ⋮ A reduction method for semi-infinite programming by means of a global stochastic approach† ⋮ Linear semi-infinite programming theory: an updated survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global optimization of univariate Lipschitz functions. I: Survey and properties
• New descent rules for solving the linear semi-infinite programming problem
• An efficient algorithm for solving semi-infinite inequality problems with box constraints
• Some outer approximation methods for semi-infinite optimization problems
• Numerical experiments in semi-infinite programming
• An extension of the simplex algorithm for semi-infinite linear programming
• Efficent line search algorithm for unconstrained optimization
• A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
• A projected lagrangian algorithm for semi-infinite programming
• On Steepest Descent

This page was built for publication: A multi-local optimization algorithm