Adaptive partition strategies in continuous and Lipschitz global optimization
Conference
·
OSTI ID:36390
A general framework is presented to analyze and construct globally convergent algorithms which can be applied to solve multiextremal optimization problems, in presence of (merely) continuous or Lipschitz-continuous problem structure. Necessary ans sufficient convergence conditions are stated; several examples (instances of partition algorithms) and prospective applications are reviewed.
- OSTI ID:
- 36390
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Lipschitzian global optimization (LGO) program system: Implementation and some recent applications
An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
Non-Interior Continuation Method for Solving the Monotone Semidefinite Complementarity Problem
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36392
An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
Journal Article
·
Sun Jan 13 23:00:00 EST 2019
· Journal of Global Optimization
·
OSTI ID:1514953
Non-Interior Continuation Method for Solving the Monotone Semidefinite Complementarity Problem
Journal Article
·
Wed May 21 00:00:00 EDT 2003
· Applied Mathematics and Optimization
·
OSTI ID:21064234