Global optimization. From theory to implementation.

zbMath1087.90005MaRDI QIDQ819915

No author found.

Publication date: 3 April 2006

Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Mathematical programming (90Cxx)

Related Items

Hybrid genetic deflated Newton method for global optimisation, Exact quadratic convex reformulations of mixed-integer quadratically constrained problems, A review of recent advances in global optimization, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, A variable neighborhood search particle filter for bearings-only target tracking, A recipe for finding good solutions to MINLPs, Probability Steiner trees and maximum parsimony in phylogenetic analysis, Granular sieving algorithm for selecting best n$$ n $$ parameters, An efficient compact quadratic convex reformulation for general integer quadratic programs, A global optimization point of view to handle non-standard object packing problems, Space splitting convexification: a local solution method for nonconvex optimal control problems, On convex relaxations of quadrilinear terms, A study of singular spectrum analysis with global optimization techniques, Extending the QCR method to general mixed-integer programs, Nonlinear optimization with GAMS /LGO, A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation, Convergent upper bounds in global minimization with nonlinear equality constraints, Optimal configuration of gamma ray machine radiosurgery units: The sphere covering subproblem, Adaptive ensemble-based optimisation for petrophysical inversion, Preface, Reformulations in Mathematical Programming: Definitions and Systematics, The stochastic trim-loss problem, Double variable neighbourhood search with smoothing for the molecular distance geometry problem, Column enumeration based decomposition techniques for a class of non-convex MINLP problems