Constrained global optimization: algorithms and applications
From MaRDI portal
Publication:1099780
zbMath0638.90064MaRDI QIDQ1099780
Panos M. Pardalos, J. Ben Rosen
Publication date: 1987
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
bilinear programming; cutting plane methods; Kuhn-Tucker conditions; nonconvex quadratic problems; Branch and Bound; 3-dimensional assignment; concave cost network problem
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C10: Integer programming
90C30: Nonlinear programming
90C20: Quadratic programming
49M37: Numerical methods based on nonlinear programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C27: Combinatorial optimization
90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming
90C09: Boolean programming
Related Items
Convexification and concavification for a general class of global optimization problems, Solving nonlinear equation systems via global partition and search: Some experimental results, A generalized duality and applications, An outer approximation method for minimizing the product of several convex functions on a convex set, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, Approximation algorithms for indefinite quadratic programming, A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio, An algorithm for solving convex programs with an additional convex- concave constraint, Discrete location problems with push-pull objectives, Problem-method classification in optimization and control, Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture, Computational complexity of norm-maximization, Stochastic modelling and optimization for environmental management, Interior-point algorithms for global optimization, Algorithms for the solution of quadratic knapsack problems, Estimation theory for nonlinear models and set membership uncertainty, Set partition by globally optimized cluster seed points, Global optimization algorithms for linearly constrained indefinite quadratic problems, Concave minimization via conical partitions and polyhedral outer approximation, A global optimization algorithm using parametric linearization relaxation, Active constraints, indefinite quadratic test problems, and complexity, Integral global optimization method for differential games with application to pursuit-evasion games, An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds, Globally optimized calibration of environmental models, Allocating procurement to capacitated suppliers with concave quantity discounts, A filled function method for constrained global optimization, Global maximization of a generalized concave multiplicative function, General variable neighborhood search for the continuous optimization, Several multi-criteria programming methods for classification, A local exploration-based differential evolution algorithm for constrained global optimization, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, Global minimization of indefinite quadratic problems, Quadratic problems defined on a convex hull of points, Checking local optimality in constrained quadratic programming is NP- hard, Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems, Parallel search algorithms in global optimization, A parallel algorithm for constrained concave quadratic global minimization, Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems, Special cases of the quadratic assignment problem, Dual quadratic estimates in polynomial and Boolean programming, The interactive fixed charge inhomogeneous flows optimization problem, Method for minimizing a convex-concave function over a convex set, Quadratic programming with one negative eigenvalue is NP-hard, Parametric simplex algorithms for solving a special class of nonconvex minimization problems, An all-linear programming relaxation algorithm for optimizing over the efficient set, An algorithm for indefinite quadratic programming with convex constraints, An interior point algorithm to solve computationally difficult set covering problems, A computational analysis of LCP methods for bilinear and concave quadratic programming, Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming, On solving a d.c. programming problem by a sequence of linear programs, A new simplicial cover technique in constrained global optimization, Reduction of indefinite quadratic programs to bilinear programs, A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique, On nonconvex optimization problems with separated nonconvex variables, Unconstrained 0-1 nonlinear programming: A nondifferentiable approach, On affine scaling algorithms for nonconvex quadratic programming, Convergence qualification of adaptive partition algorithms in global optimization, An application of Lipschitzian global optimization to product design, Algorithms for the single-source uncapacitated minimum concave-cost network flow problem, A parametric successive underestimation method for convex multiplicative programming problems, Dual estimates in multiextremal problems, Generating quadratic assignment test problems with known optimal permutations, A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case, Linear multiplicative programming, Nonlinear programming for multiperiod capacity planning in a manufacturing system, Modified \(r\)-algorithm to find the global minimum of polynomial functions, An approximate approach of global optimization for polynomial programming problems, A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure, Parallel computing in nonconvex programming, A remark on the GOP algorithm for global optimization, Isotropic effective energy simulated annealing searches for low energy molecular cluster states, A new technique for generating quadratic programming test problems, A finite algorithm for solving general quadratic problems, Global minimization of a generalized convex multiplicative function, The maximum clique problem, Optimization methods for computing global minima of nonconvex potential energy functions, A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set, Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems, Primal-relaxed dual global optimization approach, Optimization over the efficient set: Four special cases, Application of Bayesian approach to numerical methods of global and stochastic optimization, On the solution and complexity of a generalized linear complementarity problem, A finite concave minimization algorithm using branch and bound and neighbor generation, On the role of continuously differentiable exact penalty functions in constrained global optimization, A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, An algorithm for solving general D. C. programming problems, Branch-and-bound decomposition approach for solving quasiconvex-concave programs, Convex programs with an additional constraint on the product of several convex functions, Multilinear programming: Duality theories, Lower bounds for the quadratic assignment problem, Global optimization conditions for certain nonconvex minimization problems, On the construction of test problems for concave minimization algorithms, On constrained infinite-time linear quadratic optimal control, Multiplicative programming problems: Analysis and efficient point search heuristic, Lagrange duality and partitioning techniques in nonconvex global optimization, On the complexity of approximating a KKT point of quadratic programming, Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search., Best ellipsoidal relaxation to solve a nonconvex problem., The search for substationarity points in the unilateral contact problems with nonmonotone friction., Linearization method of global optimization for generalized geometric programming, Unnamed Item, Stochastic allocation of inspection capacity to competitive processes, Unnamed Item, Unnamed Item, Duality bound method for the general quadratic programming problem with quadratic constraints, A branch and bound algorithm for the maximum clique problem, Solvability of implicit complementarity problems, The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems, An exact solution method for reliability optimization in complex systems, On the use of optimization models for portfolio selection: A review and some computational results, Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions, A relaxation method for nonconvex quadratically constrained quadratic programs, Verified solution of large systems and global optimization problems, Nonconvex optimization over a polytope using generalized capacity improvement, Constructing large feasible suboptimal intervals for constrained nonlinear optimization, On the numerical treatment of nonconvex energy problems of mechanics, A reformulation-convexification approach for solving nonconvex quadratic programming problems, Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs, A new algorithm for solving the general quadratic programming problem, Delamination of composites as a substationarity problem: Numerical approximation and algorithms, Integral global minimization: Algorithms, implementations and numerical tests, An algorithm for maximizing a convex function over a simple set, Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints, Characterizing global optimality for DC optimization problems under convex inequality constraints, Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems, TABU search methodology in global optimization, A note on adapting methods for continuous global optimization to the discrete case, On the solution of concave knapsack problems, An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Separable concave minimization via partial outer approximation and branch and bound, Feature extraction algorithms for constrained global optimization. I: Mathematical foundation, A filled function method for global optimization, Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints, Parallelizing simulated annealing algorithms based on high-performance computer, Exceptional families of elements for set-valued mappings: an application to nonlinear complementarity problems, Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis., New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds, Sharp bounds for the maximum of the chi-square index in a class of contingency tables with given marginals, Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint, Generalized primal-relaxed dual approach for global optimization, A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems, Effective relaxation for microstructure simulations: algorithms and applications, Graph separation techniques for quadratic zero-one programming, On solving general reverse convex programming problems by a sequence of linear programs and line searches, A decomposition approach for global optimum search in QP, NLP and MINLP problems, Global optimization of a quadratic function subject to a bounded mixed integer constraint set, An implicit enumeration method for global optimization problems, Improving an optimization-based framework for sensitivity analysis in multi-criteria decision-making, Unnamed Item, Unnamed Item, Unnamed Item, Automatic loop shaping in QFT using hybrid optimization and constraint propagation techniques, A global optimization approach for solving the maximum clique problem
