Theoretical and computational results about optimality-based domain reductions

DOI10.1007/S10589-015-9818-5MaRDI QIDQ288410zbMATH OpenOpenAlexFDO

Authors Alberto Caprara, Marco Locatelli, 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 optimizationdomain reductionbranch-and-bound

Mathematics Subject Classification ID

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

Recommendations

• An abstract theory for the domain reduction method
• Global optimization problems and domain reduction strategies
• scientific article; zbMATH DE number 37743
• Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
• On the robustness of a simple domain reduction scheme for simulation‐based optimization
• scientific article; zbMATH DE number 4183267
• scientific article; zbMATH DE number 218262
• Optimal reductions in interaction systems
• Optimal reduction of models using a hybrid searching strategy
• Optimal reduction of solutions for support vector machines

Cites work

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

Cited in

(7)

• Global optimization problems and domain reduction strategies
• A computational study on QP problems with general linear constraints
• Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
• scientific article; zbMATH DE number 1337728 (Why is no real title available?)
• Time-optimal velocity planning by a bound-tightening technique
• Domain reduction techniques for global NLP and MINLP optimization
• (Global) optimization: historical notes and recent developments

Describes a project that uses

Uses Software

• BARON

This page was built for publication: Theoretical and computational results about optimality-based domain reductions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q288410)