Handbook of test problems in local and global optimization
From MaRDI portal
Publication:1304172
zbMath0943.90001MaRDI QIDQ1304172
John L. Klepeis, Stephen T. Harding, Zeynep H. Gümüş, Claire S. Adjiman, Carl A. Schweiger, Christodoulos A. Floudas, William R. Esposito, Clifford A. Meyer, Panos M. Pardalos
Publication date: 10 October 1999
Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)
test problemsmathematical optimizationcomputational chemistryGAMSlinks to existing test problem collectionsMINOPT
Mathematical programming (90Cxx) Computational methods for problems pertaining to operations research and mathematical programming (90-08) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00)
Related Items (only showing first 100 items - show all)
Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems ⋮ A successive linear approximation algorithm for the global minimization of a concave quadratic program ⋮ A class of parameter-free filled functions for box-constrained system of nonlinear equations ⋮ Extended reverse-convex programming: an approximate enumeration approach to global optimization ⋮ On the global convergence of a Levenberg-Marquardt method for constrained nonlinear equations ⋮ Global optimization of signomial geometric programming problems ⋮ Global optimization with spline constraints: a new branch-and-bound method based on B-splines ⋮ An inexact-restoration method for nonlinear bilevel programming problems ⋮ A review of recent advances in global optimization ⋮ A multi-layer line search method to improve the initialization of optimization algorithms ⋮ Best practices for comparing optimization algorithms ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Multiobjective cuckoo search for design optimization ⋮ On generalized geometric programming problems with non-positive variables ⋮ An inexact Newton-like conditional gradient method for constrained nonlinear systems ⋮ Topographical global initialization for finding all solutions of nonlinear systems with constraints ⋮ How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results ⋮ On metaheuristics for solving the parameter estimation problem in dynamic systems: a comparative study ⋮ A modified hybrid genetic algorithm for solving nonlinear optimal control problems ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems ⋮ Piece adding technique for convex maximization problems ⋮ A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints ⋮ Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations ⋮ A new filled function method for an unconstrained nonlinear equation ⋮ Individual confidence intervals for solutions to expected value formulations of stochastic variational inequalities ⋮ Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience ⋮ The cluster problem in constrained global optimization ⋮ Inexact Newton method via Lanczos decomposed technique for solving box-constrained nonlinear systems ⋮ A framework for globally optimizing mixed-integer signomial programs ⋮ On solving linear complementarity problems by DC programming and DCA ⋮ Border basis relaxation for polynomial optimization ⋮ Probability bounds analysis for nonlinear population ecology models ⋮ Local optimization of dynamic programs with guaranteed satisfaction of path constraints ⋮ Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems ⋮ Global optimality conditions and optimization methods for quadratic assignment problems ⋮ A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming ⋮ Extending and relating different approaches for solving fuzzy quadratic problems ⋮ TRESNEI, a MATLAB trust-region solver for systems of nonlinear equalities and inequalities ⋮ A trajectory-based method for mixed integer nonlinear programming problems ⋮ The role of different genetic operators in the optimization of magnetic models ⋮ On linear programs with linear complementarity constraints ⋮ Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts ⋮ A derivative-free trust region algorithm with nonmonotone filter technique for bound constrained optimization ⋮ A filled function method for constrained global optimization ⋮ New bounds on the unconstrained quadratic integer programming problem ⋮ A novel optimization method for nonconvex quadratically constrained quadratic programs ⋮ A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization ⋮ Finding the roots of system of nonlinear equations by a novel filled function method ⋮ Global optimality conditions and optimization methods for quadratic knapsack problems ⋮ Active set strategies in an ellipsoid algorithm for nonlinear programming ⋮ General variable neighborhood search for the continuous optimization ⋮ Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs ⋮ Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm ⋮ An affine scaling derivative-free trust region method with interior backtracking technique for bounded-constrained nonlinear programming ⋮ A filling function method for unconstrained global optimization ⋮ Global optimality conditions and optimization methods for polynomial programming problems ⋮ Conjugate gradient path method without line search technique for derivative-free unconstrained optimization ⋮ Bounds tightening based on optimality conditions for nonconvex box-constrained optimization ⋮ DC programming and DCA: thirty years of developments ⋮ A new trust-region method for solving systems of equalities and inequalities ⋮ Analysis of EEG data using optimization, statistics, and dynamical system techniques ⋮ Global optimization test problems based on random field composition ⋮ MSO: a framework for bound-constrained black-box global optimization algorithms ⋮ A filled function method dominated by filter for nonlinearly global optimization ⋮ Attractive force search algorithm for piecewise convex maximization problems ⋮ Piecewise convex maximization problems: Piece adding technique ⋮ Filled function method for nonlinear equations ⋮ An integral function and vector sequence method for unconstrained global optimization ⋮ Levenberg-Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints ⋮ Piecewise-linear approximations of multidimensional functions ⋮ A dynamic convexized method for nonconvex mixed integer nonlinear programming ⋮ Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints ⋮ Some global optimization problems on Stiefel manifolds ⋮ The oracle penalty method ⋮ Genanneal: genetically modified simulated annealing ⋮ MinFinder: locating all the local minima of a function ⋮ An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions ⋮ Test problem generator for the multidimensional assignment problem ⋮ Enhancing PSO methods for global optimization ⋮ On locating all roots of systems of nonlinear equations inside bounded domain using global optimization methods ⋮ A filled function method for global optimization with inequality constraints ⋮ A Newton conditional gradient method for constrained nonlinear systems ⋮ Fuzzy costs in quadratic programming problems ⋮ A branch and reduce approach for solving a class of low rank d.c. programs ⋮ The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization ⋮ New methods for calculating \(\alpha\)BB-type underestimators ⋮ The stochastic trim-loss problem ⋮ TACO: a toolkit for AMPL control optimization ⋮ Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities ⋮ Extended ant colony optimization for non-convex mixed integer nonlinear programming ⋮ Recognizing underlying sparsity in optimization ⋮ A new filled function method for nonlinear equations ⋮ Solving systems of nonlinear equations with continuous GRASP ⋮ Global optimization of robust chance constrained problems ⋮ Nonmonotonic reduced projected Hessian method via an affine scaling interior modified gradient path for bounded-constrained optimization ⋮ A projected gradient method with nonmonotonic backtracking technique for solving convex constrained monotone variational inequality problem ⋮ Statistical inferences for termination of Markov type random search algorithms ⋮ Global convergence enhancement of classical linesearch interior point methods for MCPs ⋮ An affine scaling trust-region approach to bound-constrained nonlinear systems
Uses Software
This page was built for publication: Handbook of test problems in local and global optimization
