Global optimization algorithms for linearly constrained indefinite quadratic problems
From MaRDI portal
Publication:810370
DOI10.1016/0898-1221(91)90163-XzbMATH Open0733.90051OpenAlexW2000156923MaRDI QIDQ810370FDOQ810370
Authors: 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
Recommendations
- A method of global optimization for indefinite quadratic programming problems
- Global minimization of indefinite quadratic problems
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
- A new global optimization algorithm for indefinite quadratic programs
- On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
global optimizationindefinite symmetric matrixBenders decompositionbilinear programmingglobally optimal solutionnonconvex quadratic problems
Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- Title not available (Why is that?)
- Partitioning procedures for solving mixed-variables programming problems
- Constrained global optimization: algorithms and applications
- Generalized Benders decomposition
- Quasi-Concave Programming
- An Algorithm for Separable Nonconvex Programming Problems
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Jointly constrained bilinear programs and related problems: An overview
- Methods for Global Concave Minimization: A Bibliographic Survey
- An algorithm for nonconvex programming problems
- A Variable-Complexity Norm Maximization Problem
- Global minimization of indefinite quadratic problems
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Title not available (Why is that?)
- Generation of large-scale quadratic programs for use as global optimization test problems
- A cutting plane algorithm for solving bilinear programs
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- Global Optimization Approach to the Linear Complementarity Problem
- Optimization with disjunctive constraints
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- On the global minimization of concave functions
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Title not available (Why is that?)
- Global minimization of a difference of two convex functions
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- Quasi-concave minimization subject to linear constraints
- The bilinear programming problem
- Bilinear programming: An exact algorithm
- A cutting plane algorithm for the bilinear programming problem
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- On the convergence of global methods in multiextremal optimization
- Checking local optimality in constrained quadratic programming is NP- hard
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
- Parallel search algorithms in global optimization
- The Variable Reduction Method for Nonlinear Programming
- Title not available (Why is that?)
- On a class of quadratic programs
- On the convergence of two branch-and-bound algorithms for nonconvex programming problems
- On the generation of deep disjunctive cutting planes
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
- An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
- Relationship between bilinear programming and concave minimization under linear constraints
- Title not available (Why is that?)
- Globally convergent decomposition methods for nonconvex optimization problems
- A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
- The Indefinite Quadratic Programming Problem
- On the convexification of nonlinear programming problems: An applications-oriented survey
- Enumerative techniques for solving some nonconvex global optimization problems
- Quadratic problems defined on a convex hull of points
- Title not available (Why is that?)
- Nonconvex Quadratic Programming via Generalized Polars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonlinear cost network models in transportation analysis
- Title not available (Why is that?)
- Indefinite Quadratic Solid Transportation Problem
- Title not available (Why is that?)
- Dualität und Approximation bei konvexen Optimierungsproblemen
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variational principles in exotic topological spaces
- Stationary points of quadratic maximum-problems
- A method for solving maximum-problems with a nonconcave quadratic objective function
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bemerkungen zum Problem der nichtkonvexen Programmierung
- A Method for Solving the Indefinite Quadratic Programming Problem
- Quadratic Programming with a Quasiconvex Objective Function
Cited In (38)
- A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
- A new global optimization algorithm for indefinite quadratic programs
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
- The bounds of feasible space on constrained nonconvex quadratic programming
- A decomposition method for global and local quadratic minimization
- Global solutions to folded concave penalized nonconvex learning
- On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
- Title not available (Why is that?)
- An efficient global algorithm for a class of indefinite separable quadratic programs
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
- Title not available (Why is that?)
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- On global optimization with indefinite quadratics
- Global optimization: A quadratic programming perspective
- Reduction of indefinite quadratic programs to bilinear programs
- Canonical duality theory: connections between nonconvex mechanics and global optimization
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation
- A computational comparison of some branch and bound methods for indefinite quadratic programs
- An outcome space approach for generalized convex multiplicative programs
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- GLOMIQO: global mixed-integer quadratic optimizer
- An algorithm for global minimization of linearly constrained quadratic functions
- A method of global optimization for indefinite quadratic programming problems
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- On the solution of generalized multiplicative extremum problems
- Globally solving nonconvex quadratic programming problems via completely positive programming
- On Conic Relaxations of Generalization of the Extended Trust Region Subproblem
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Bilinear modeling solution approach for fixed charge network flow problems
- Relaxing the optimality conditions of box QP
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- Title not available (Why is that?)
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
- A global optimization algorithm for indefinite quadratically constrained quadratic programs
This page was built for publication: Global optimization algorithms for linearly constrained indefinite quadratic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810370)
