Theoretical and computational results about optimality-based domain reductions

DOI10.1007/s10589-015-9818-5zbMath1348.90525OpenAlexW2237869155MaRDI QIDQ288410

Marco Locatelli, Alberto Caprara, Michele Monaci

Publication date: 25 May 2016

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

Full work available at URL: https://doi.org/10.1007/s10589-015-9818-5

zbMATH Keywords

global optimizationbranch-and-bounddomain reduction

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items

A computational study on QP problems with general linear constraints, (Global) optimization: historical notes and recent developments, Domain reduction techniques for global NLP and MINLP optimization, Time-optimal velocity planning by a bound-tightening technique

Uses Software

• BARON

Cites Work

• A convex analysis approach for convex multiplicative programming
• Quadratic programming with one negative eigenvalue is NP-hard
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• An analytical approach to global optimization
• A parallel stochastic method for solving linearly constrained concave global minimization problems
• Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
• Calculation of bounds on variables satisfying nonlinear inequality constraints
• Linear multiplicative programming
• A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
• Multiplicative programming problems: Analysis and efficient point search heuristic
• Global optimization of multiplicative programs
• Heuristic methods for linear multiplicative programming
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• A branch-and-reduce approach to global optimization
• BARON: A general purpose global optimization software package
• Global optimization problems and domain reduction strategies
• \(NP\)-hardness of linear multiplicative programming and related problems
• A finite branch-and-bound algorithm for linear multiplicative programming