Deterministic methods in constrained global optimization: Some recent advances and new fields of application

From MaRDI portal
Publication:3494393

DOI<433::AID-NAV3220370403>3.0.CO;2-2 10.1002/1520-6750(199008)37:4<433::AID-NAV3220370403>3.0.CO;2-2zbMath0709.90093OpenAlexW2077519839MaRDI QIDQ3494393

Reiner Horst

Publication date: 1990

Full work available at URL: https://doi.org/10.1002/1520-6750(199008)37:4<433::aid-nav3220370403>3.0.co;2-2



Related Items

COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS, A finite concave minimization algorithm using branch and bound and neighbor generation, Global optimization in biology and medicine, Algorithms to solve some problems of concave programming with linear constraints, Some outer approximation methods for semi-infinite optimization problems, A global optimization algorithm for linear fractional and bilinear programs, A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem, On solving general reverse convex programming problems by a sequence of linear programs and line searches, Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, A filled function method for constrained global optimization, Criteria for unconstrained global optimization, An all-linear programming relaxation algorithm for optimizing over the efficient set, Mathematical programs with a two-dimensional reverse convex constraint, On solving a d.c. programming problem by a sequence of linear programs, A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique, Convergence qualification of adaptive partition algorithms in global optimization, An interactive multiobjective nonlinear programming procedure, Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves, Calculation of bounds on variables satisfying nonlinear inequality constraints, A one-parameter filled function for nonsmooth global optimization and its application, Convexification and concavification for a general class of global optimization problems, A note on adapting methods for continuous global optimization to the discrete case, Progress payments in project scheduling problems., A NOVEL MONOTONIZATION TRANSFORMATION FOR SOME CLASSES OF GLOBAL OPTIMIZATION PROBLEMS, Set partition by globally optimized cluster seed points, Concave minimization via conical partitions and polyhedral outer approximation, A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set



Cites Work