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 programmingcutting plane methodsKuhn-Tucker conditionsnonconvex quadratic problemsBranch and Bound3-dimensional assignmentconcave cost network problem
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
Deterministic methods in constrained global optimization: Some recent advances and new fields of application, 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, Feature extraction algorithms for constrained global optimization. I: Mathematical foundation, Lower bounds for the quadratic assignment problem, A filled function method for global optimization, Global optimization conditions for certain nonconvex minimization problems, On the construction of test problems for concave minimization algorithms, Stochastic allocation of inspection capacity to competitive processes, On the use of optimization models for portfolio selection: A review and some computational results, A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming, 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, Promoting symmetric weight selection in data envelopment analysis: a penalty function approach, On constrained infinite-time linear quadratic optimal control, 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, Verified solution of large systems and global optimization problems, Global optimization of a quadratic function subject to a bounded mixed integer constraint set, On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming, An implicit enumeration method for global optimization problems, Nonconvex optimization over a polytope using generalized capacity improvement, Constructing large feasible suboptimal intervals for constrained nonlinear optimization, A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs, Solving nonlinearly constrained global optimization problem via an auxiliary function method, 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, Unnamed Item, A new algorithm for solving the general quadratic programming problem, Multiplicative programming problems: Analysis and efficient point search heuristic, Delamination of composites as a substationarity problem: Numerical approximation and algorithms, Integral global minimization: Algorithms, implementations and numerical tests, Lagrange duality and partitioning techniques in nonconvex global optimization, A global optimization approach for solving the maximum clique problem, 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, On the complexity of approximating a KKT point of quadratic programming, 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, An exact penalty function method for nonlinear mixed discrete programming problems, A general purpose exact solution method for mixed integer concave minimization problems, A novel one-parameter filled function method with an application to pathological analysis, Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds, Topology optimization using the discrete element method. II: Material nonlinearity, An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints, Numerical methods using two different approximations of space-filling curves for black-box global optimization, A new penalty parameter for linearly constrained 0--1 quadratic programming problems, Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search., Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints, A deterministic annealing algorithm for the minimum concave cost network flow problem, Best ellipsoidal relaxation to solve a nonconvex problem., Unnamed Item, TABU search methodology in global optimization, Improving an optimization-based framework for sensitivity analysis in multi-criteria decision-making, Parallelizing simulated annealing algorithms based on high-performance computer, A sufficient conditions for global quadratic optimization, Exceptional families of elements for set-valued mappings: an application to nonlinear complementarity problems, Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems, Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis., Duality bound method for the general quadratic programming problem with quadratic constraints, Linearization method of global optimization for generalized geometric programming, A branch and bound algorithm for the maximum clique problem, New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds, 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, Measuring resetting of brain dynamics at epileptic seizures: application of global optimization and spatial synchronization techniques, 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, A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables, A logarithmic descent direction algorithm for the quadratic knapsack problem, Solvability of implicit complementarity problems, Subdeterminants and Concave Integer Quadratic Programming, On approximation algorithms for concave mixed-integer quadratic programming, Exact dual bounds for some nonconvex minimax quadratic optimization problems, Unnamed Item, 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, Automatic loop shaping in QFT using hybrid optimization and constraint propagation techniques, On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches, Facility location and capacity acquisition: An integrated approach, Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem, A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems, Effective relaxation for microstructure simulations: algorithms and applications, The search for substationarity points in the unilateral contact problems with nonmonotone friction., An algorithm for concave integer minimization over a polyhedron, Hybrid limited memory gradient projection methods for box-constrained optimization problems, 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
