A collection of test problems for constrained global optimization algorithms
From MaRDI portal
Publication:1188890
zbMath0718.90054MaRDI QIDQ1188890
Panos M. Pardalos, Christodoulos A. Floudas
Publication date: 23 January 1993
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20) Parallel algorithms in computer science (68W10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Employing the cloud for finding solutions to large systems of nonlinear equations, Unnamed Item, Inscribed ball and enclosing box methods for the convex maximization problem, Global optimality conditions for nonconvex minimization problems with quadratic constraints, Application of Bayesian approach to numerical methods of global and stochastic optimization, A generalization of the construction of test problems for nonconvex optimization, Smoothing approximation to the lower order exact penalty function for inequality constrained optimization, A wide class of test functions for global optimization, A class of test functions for global optimization, On the construction of test problems for concave minimization algorithms, Global optimization with spline constraints: a new branch-and-bound method based on B-splines, Stochastic filter methods for generally constrained global optimization, A global optimization algorithm for linear fractional and bilinear programs, Modular global optimisation in chemical engineering, Accelerated random search for constrained global optimization assisted by radial basis function surrogates, A penalty function-based differential evolution algorithm for constrained global optimization, Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art, Best practices for comparing optimization algorithms, Sequence of polyhedral relaxations for nonlinear univariate functions, Test problem generator for unconstrained global optimization, Linearly constrained global optimization and stochastic differential equations, Constructing large feasible suboptimal intervals for constrained nonlinear optimization, Biogeography-based optimization for constrained optimization problems, Generalized S-lemma and strong duality in nonconvex quadratic programming, How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results, A bounded degree SOS hierarchy for polynomial optimization, Global optimality conditions and optimization methods for constrained polynomial programming problems, Computational experience with penalty-barrier methods for nonlinear programming, On the utility of randomly generated functions for performance evaluation of evolutionary algorithms, A double-multiplicative dynamic penalty approach for constrained evolutionary optimization, Piece adding technique for convex maximization problems, Partitioning procedure for polynomial optimization, Designing and reporting on computational experiments with heuristic methods, A branch-and-reduce approach to global optimization, Convergence analysis of a proximal Gauss-Newton method, Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions, Study of multiscale global optimization based on parameter space partition, Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm, Multi-parametric disaggregation technique for global optimization of polynomial programming problems, A global optimization point of view to handle non-standard object packing problems, Global minimization of non-smooth unconstrained problems with filled function, Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization, Minimizing the sum of a convex function and the product of two affine functions over a convex set, Lower bound functions for polynomials, Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems, Performance of several nonlinear programming software packages on microcomputers., A projected-gradient interior-point algorithm for complementarity problems, On linear programs with linear complementarity constraints, Global minimization of nonsmooth constrained global optimization with filled function, A filled function method for constrained global optimization, Combining interval branch and bound and stochastic search, Self-adaptive velocity particle swarm optimization for solving constrained optimization problems, Global optimization by continuous grasp, Improving the performance of weighted Lagrange-multiplier methods for nonlinear constrained optimization, A new hybrid algorithm of scatter search and Nelder-Mead algorithms to optimize joint economic lot sizing problem, Global optimality conditions and optimization methods for polynomial programming problems, Reduction of indefinite quadratic programs to bilinear programs, Investigating a hybrid simulated annealing and local search algorithm for constrained optimization, MINQ8: general definite and bound constrained indefinite quadratic programming, Memetic particle swarm optimization, CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method, DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems, Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation, Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type, A new auxiliary function method for general constrained global optimization, Generating quadratic assignment test problems with known optimal permutations, Quasiconvex relaxations based on interval arithmetic, Piecewise convex maximization problems: Piece adding technique, Second order cone programming relaxation of nonconvex quadratic optimization problems, Some global optimization problems on Stiefel manifolds, A fast memoryless interval-based algorithm for global optimization, The oracle penalty method, Extended duality for nonlinear programming, On the chromatic number of graphs, A one-parameter filled function method applied to nonsmooth constrained global optimization, A cellular framework for structural analysis and optimization, Properties and numerical testing of a parallel global optimization algorithm, Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems, Unnamed Item, A filled function method for global optimization with inequality constraints, Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints, Smoothing of the lower-order exact penalty function for inequality constrained optimization, Dynamic search trajectory methods for global optimization, A dynamic programming extension to the steady state refinery-LP, Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction, Test problem construction for linear bilevel programming problems, Rigorous convex underestimators for general twice-differentiable problems, Evolution program for deterministic and stochastic optimizations, Towards ``Ideal multistart. A stochastic approach for locating the minima of a continuous function inside a bounded domain, A sublevel moment-SOS hierarchy for polynomial optimization, On proving existence of feasible points in equality constrained optimization problems, Computational experience using an edge search algorithm for linear reverse convex programs, A Collection of Test Multiextremal Optimal Control Problems, Interval mathematics, algebraic equations and optimization, Parallel computing in nonconvex programming, Linearly constrained global optimization: a general solution algorithm with applications., New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints, A new technique for generating quadratic programming test problems, Primal-relaxed dual global optimization approach, On global optimization in two-dimensional scaling, Global minimization by reducing the duality gap, Genetic algorithm for constrained global optimization in continuous variables, Univariate parameterization for global optimization of mixed-integer polynomial problems
