State of the art in global optimization: computational methods and applications. Papers of the conference, Princeton, NJ, USA, April 28--30, 1995
From MaRDI portal
Publication:1921383
zbMath0847.00058MaRDI QIDQ1921383
No author found.
Publication date: 26 August 1996
Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)
00B25: Proceedings of conferences of miscellaneous specific interest
49-06: Proceedings, conferences, collections, etc. pertaining to calculus of variations and optimal control
90-06: Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming
Related Items
On Acceleration of Derivative-Free Univariate Lipschitz Global Optimization Methods, Solving a class of continuous global optimization problems using quantum algorithms, Multidimensional global optimization using numerical estimates of objective function derivatives, Best proximity point theorems: resolution of an important non-linear programming problem, Best proximity point theorems: an exploration of a common solution to approximation and optimization problems, Univariate global optimization with multiextremal non-differentiable constraints without penalty functions, Piecewise-linear approximations of multidimensional functions, Convexity of products of univariate functions and convexification transformations for geometric programming, Global optimization of signomial mixed-integer nonlinear programming problems with free variables, GMG -- a guaranteed global optimization algorithm: application to remote sensing, Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems, Discrete optimization in partially ordered sets, Multi-parametric disaggregation technique for global optimization of polynomial programming problems, A perturbed version of an inexact generalized Newton method for solving nonsmooth equations, A review of deterministic optimization methods in engineering and management, Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms