Global optimization algorithms for linearly constrained indefinite quadratic problems

DOI10.1016/0898-1221(91)90163-XzbMath0733.90051OpenAlexW2000156923MaRDI QIDQ810370

Panos M. Pardalos

Publication date: 1991

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(91)90163-x

zbMATH Keywords

global optimizationbilinear programmingBenders decompositionglobally optimal solutionindefinite symmetric matrixnonconvex quadratic problems

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Global solutions to folded concave penalized nonconvex learning, Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound, Bilinear modeling solution approach for fixed charge network flow problems, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, On solving general reverse convex programming problems by a sequence of linear programs and line searches, A reformulation-convexification approach for solving nonconvex quadratic programming problems, GLOMIQO: global mixed-integer quadratic optimizer, A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, On the solution of generalized multiplicative extremum problems, A computational comparison of some branch and bound methods for indefinite quadratic programs, New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation, The bounds of feasible space on constrained nonconvex quadratic programming, Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization, A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations, Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial, Relaxing the optimality conditions of box QP, Globally solving nonconvex quadratic programming problems via completely positive programming, An outcome space approach for generalized convex multiplicative programs, An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation, On Conic Relaxations of Generalization of the Extended Trust Region Subproblem, Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems, Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties, Decomposition methods for solving nonconvex quadratic programs via branch and bound

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Globally convergent decomposition methods for nonconvex optimization problems
• On the convexification of nonlinear programming problems: An applications-oriented survey
• On the global minimization of concave functions
• Jointly constrained bilinear programs and related problems: An overview
• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
• On the convergence of global methods in multiextremal optimization
• On a class of quadratic programs
• Global minimization of indefinite quadratic problems
• Constrained global optimization: algorithms and applications
• Enumerative techniques for solving some nonconvex global optimization problems
• Quadratic problems defined on a convex hull of points
• Checking local optimality in constrained quadratic programming is NP- hard
• Parallel search algorithms in global optimization
• Partitioning procedures for solving mixed-variables programming problems
• Optimization with disjunctive constraints
• On the convergence of two branch-and-bound algorithms for nonconvex programming problems
• Relationship between bilinear programming and concave minimization under linear constraints
• Quasi-concave minimization subject to linear constraints
• Generalized Benders decomposition
• Generation of large-scale quadratic programs for use as global optimization test problems
• Nonconvex Quadratic Programming via Generalized Polars
• Quasi-Concave Programming
• Jointly Constrained Biconvex Programming
• On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
• A Variable-Complexity Norm Maximization Problem
• Global minimization of large-scale constrained concave quadratic problems by separable programming
• Methods for Global Concave Minimization: A Bibliographic Survey
• Nonlinear cost network models in transportation analysis
• Global minimization of a difference of two convex functions
• An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
• Global Optimization Approach to the Linear Complementarity Problem
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• On the generation of deep disjunctive cutting planes
• Indefinite Quadratic Solid Transportation Problem
• An algorithm for nonconvex programming problems
• The bilinear programming problem
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• A cutting plane algorithm for solving bilinear programs
• A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
• Bilinear programming: An exact algorithm
• A cutting plane algorithm for the bilinear programming problem
• Dualität und Approximation bei konvexen Optimierungsproblemen
• The Indefinite Quadratic Programming Problem
• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
• Stationary points of quadratic maximum-problems
• A method for solving maximum-problems with a nonconcave quadratic objective function
• Bemerkungen zum Problem der nichtkonvexen Programmierung
• An Algorithm for Separable Nonconvex Programming Problems
• Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
• A Method for Solving the Indefinite Quadratic Programming Problem
• The Variable Reduction Method for Nonlinear Programming
• Quadratic Programming with a Quasiconvex Objective Function
• An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
• Solving the Fixed Charge Problem by Ranking the Extreme Points