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
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, An efficient convexification method for solving generalized geometric problems, ARGONAUT: algorithms for global optimization of constrained grey-box computational problems, New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming, Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem, Imperialist competitive algorithm for solving systems of nonlinear equations, Modifications of real code genetic algorithm for global optimization, Adaptive memory programming for constrained global optimization, A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems, Finding all global optima of engineering design problems with discrete signomial terms, A filled function method for nonlinear equations, A robust algorithm for quadratic optimization under quadratic constraints, An interior-point affine-scaling trust-region method for semismooth equations with box constraints, Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds, Global convergence and the Powell singular function, Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables, Development and calibration of a currency trading strategy using global optimization, Conic approximation to quadratic optimization with linear complementarity constraints, Chaotic quantum behaved particle swarm optimization algorithm for solving nonlinear system of equations, Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms, A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization, A global convergent derivative-free method for solving a system of non-linear equations, An objective penalty method for optimistic bilevel programming problems, Handling equality constraints in evolutionary optimization, Optimality Conditions for the Minimization of Quadratic 0-1 Problems, On the global convergence of an inexact quasi-Newton conditional gradient method for constrained nonlinear systems, Derivative-free methods for bound constrained mixed-integer optimization, A method of sequential log-convex programming for engineering design, A sub-additive DC approach to the complementarity problem, Inexact Newton method with feasible inexact projections for solving constrained smooth and nonsmooth equations, Constrained dogleg methods for nonlinear systems with simple bounds, Application of one‐step method to parameter estimation in ODE models, A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms, A general purpose exact solution method for mixed integer concave minimization problems, Survey of Piecewise Convex Maximization and PCMP over Spherical Sets, An exact penalty global optimization approach for mixed-integer programming problems, Multi-parametric disaggregation technique for global optimization of polynomial programming problems, A global optimization point of view to handle non-standard object packing problems, On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch, Feasibility and Dominance Rules in the Electromagnetism-Like Algorithm for Constrained Global Optimization, Approximate norm descent methods for constrained nonlinear systems, Multiagent algorithms for optimizing bundles of trajectories of deterministic systems with incomplete instant feedback, Solving constrained global optimization problems by using hybrid evolutionary computing and artificial life approaches, Convex underestimators of polynomials, A partition-based global optimization algorithm, Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies, A sharp augmented Lagrangian-based method in constrained non-convex optimization, A new filled function method for global optimization, Mini-batch adaptive random search method for the parametric identification of dynamic systems, Global optimization by continuous grasp, Multistart algorithms for seeking feasibility, Generalized filtering algorithms for infeasibility analysis, Nonlinear optimization with GAMS /LGO, A new class of test functions for global optimization, A trust region SQP algorithm for mixed-integer nonlinear programming, A novel approach to bilevel nonlinear programming, Parametric global optimisation for bilevel programming, Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives, An affine scaling interior algorithm via Lanczos path for solving bound-constrained nonlinear systems, Local optima smoothing for global optimization, Constructing test functions for global optimization using continuous formulations of graph problems, DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems, Global Optimization in Practice:State of the Art and Perspectives, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Comparison of deterministic and stochastic approaches to global optimization, Semidefinite relaxation for linear programs with equilibrium constraints, An adaptive learning rate backpropagation‐type neural network for solving n × n systems on nonlinear algebraic equations, A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience, Application of deterministic low-discrepancy sequences in global optimization, A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs, A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs, An inexact modified subgradient algorithm for nonconvex optimization, A new trust region method for solving least-square transformation of system of equalities and inequalities, A method for solving bilevel linear programming problems, Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization, Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems, On new iterative method for solving systems of nonlinear equations, Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints, Performance of convex underestimators in a branch-and-bound framework, A new auxiliary function method for systems of nonlinear equations, A “Joint+Marginal” Approach in Optimization, A local search method for optimization problem with d.c. inequality constraints, Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems, Competitive facility location problem with attractiveness adjustment of the follower on the closed supply chain, An inexact affine scaling Levenberg-Marquardt method under local error bound conditions, Border Basis for Polynomial System Solving and Optimization, Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint, Novel global optimization algorithm with a space-filling curve and integral function, Modelling and optimization applied to the design of fast hydrodynamic focusing microfluidic mixer for protein folding, An affine scaling trust-region algorithm with interior backtracking technique for solving bound-constrained nonlinear systems, A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations, Tabu search directed by direct search methods for nonlinear global optimization, Unnamed Item, A novel filled function method for nonlinear equations, A new class of improved convex underestimators for twice continuously differentiable constrained NLPs, Continuous cubic formulations for cluster detection problems in networks, BOLIB: Bilevel Optimization LIBrary of Test Problems, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives, Univariate parameterization for global optimization of mixed-integer polynomial problems, (Global) optimization: historical notes and recent developments, Employing the cloud for finding solutions to large systems of nonlinear equations, Newton-Anderson at Singular Points, Necessary and sufficient conditions for an extremum in complex problems of optimization of systems described by polynomial and analytic functions, Almost automorphic solutions in distribution sense for Clifford‐valued stochastic neural network with delays
Uses Software
