Constrained global optimization: algorithms and applications

zbMath0638.90064MaRDI QIDQ1099780

Panos M. Pardalos, J. Ben Rosen

Publication date: 1987

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

bilinear programmingcutting plane methodsKuhn-Tucker conditionsnonconvex quadratic problemsBranch and Bound3-dimensional assignmentconcave cost network problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Convex programming (90C25) Integer programming (90C10) Nonlinear programming (90C30) Quadratic programming (90C20) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Boolean programming (90C09)

Related Items (only showing first 100 items - show all)

Global optimality conditions for nonconvex minimization problems with quadratic constraints ⋮ Application of Bayesian approach to numerical methods of global and stochastic optimization ⋮ A modified real coded genetic algorithm for constrained optimization ⋮ Non-degenerate necessary optimality conditions for the optimal control problem with equality-type state constraints ⋮ Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization ⋮ New results on the equivalence between zero-one programming and continuous concave programming ⋮ Global minimization of indefinite quadratic problems ⋮ Stability of fractional order switching systems ⋮ Quadratic problems defined on a convex hull of points ⋮ Checking local optimality in constrained quadratic programming is NP- hard ⋮ Computing tight bounds via piecewise linear functions through the example of circle cutting problems ⋮ 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 ⋮ A reformulation framework for global optimization ⋮ Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems ⋮ A global optimization algorithm using parametric linearization relaxation ⋮ Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach ⋮ Special cases of the quadratic assignment problem ⋮ Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems ⋮ A new bound-and-reduce approach of nonconvex quadratic programming problems ⋮ Active constraints, indefinite quadratic test problems, and complexity ⋮ Integral global optimization method for differential games with application to pursuit-evasion games ⋮ Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations ⋮ 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 ⋮ Dual quadratic estimates in polynomial and Boolean programming ⋮ The interactive fixed charge inhomogeneous flows optimization problem ⋮ General variable neighborhood search for the continuous optimization ⋮ 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 new filled function method applied to unconstrained global optimization ⋮ 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 ⋮ Global optimization algorithm for mixed integer quadratically constrained quadratic program ⋮ Several multi-criteria programming methods for classification ⋮ 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 ⋮ 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 ⋮ 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 ⋮ Dual estimates in multiextremal problems ⋮ Generating quadratic assignment test problems with known optimal permutations ⋮ RelaxMCD: smooth optimisation for the minimum covariance determinant estimator ⋮ A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case ⋮ Linear multiplicative programming ⋮ Discrete location problems with push-pull objectives ⋮ An integral function and vector sequence method for unconstrained global optimization ⋮ Piecewise-linear approximations of multidimensional functions ⋮ Convexification and concavification for a general class of global optimization problems ⋮ An algorithm for nonlinear optimization problems with binary variables ⋮ Frequency domain iterative feedforward/feedback tuning for MIMO ANVC ⋮ Solving nonlinear equation systems via global partition and search: Some experimental results ⋮ A local exploration-based differential evolution algorithm for constrained global optimization ⋮ 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 ⋮ Nonlinear programming for multiperiod capacity planning in a manufacturing system ⋮ Modified \(r\)-algorithm to find the global minimum of polynomial functions ⋮ Global optimization from concave minimization to concave mixed variational inequality ⋮ 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 ⋮ Stochastic modelling and optimization for environmental management ⋮ Interior-point algorithms for global optimization ⋮ 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 ⋮ Algorithms for the solution of quadratic knapsack problems ⋮ Estimation theory for nonlinear models and set membership uncertainty ⋮ The maximum clique problem ⋮ Set partition by globally optimized cluster seed points ⋮ Global optimization algorithms for linearly constrained indefinite quadratic problems ⋮ Optimization methods for computing global minima of nonconvex potential energy functions ⋮ Concave minimization via conical partitions and polyhedral outer approximation ⋮ 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

This page was built for publication: Constrained global optimization: algorithms and applications