A finite algorithm for solving general quadratic problems
From MaRDI portal
A global optimization procedure for indefinite quadratic problems over a polyhedron in \(\mathbb{R}^ n\) is developed. In nondegenerate situations the procedure is shown to be finite and exact. The paper is organized as follows: Section 1: Introduction; Section 2: Escaping from local solutions; Section 3: Using pseudoconvexity to improve efficiency; Section 4: A finite global optimization procedure. In Section 4 an example is given. The procedure proposed uses the simplex algorithm.
Recommendations
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Global minimization of indefinite quadratic problems
- A Global Optimization Algorithm for Concave Quadratic Programming Problems
- scientific article; zbMATH DE number 4018776
- scientific article; zbMATH DE number 4133837
Cites work
- A Global Optimization Algorithm for Concave Quadratic Programming Problems
- Checking local optimality in constrained quadratic programming is NP- hard
- Constrained global optimization: algorithms and applications
- Finite criteria for conditional definiteness of quadratic forms
- scientific article; zbMATH DE number 4174235 (Why is no real title available?)
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 16313 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 3557508 (Why is no real title available?)
- scientific article; zbMATH DE number 1419369 (Why is no real title available?)
- scientific article; zbMATH DE number 3350062 (Why is no real title available?)
- On copositive matrices
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- Quadratic programming with one negative eigenvalue is NP-hard
- Some NP-complete problems in quadratic and nonlinear programming
- The simplex method. A probabilistic analysis
Cited in
(26)- An improved algorithm for quadratic equation classification and Petrov classification
- Global escape strategies for maximizing quadratic forms over a simplex
- Necessary and sufficient global optimality conditions for convex maximization revisited
- Optimality conditions and optimization methods for quartic polynomial optimization
- A new algorithm for solving the general quadratic programming problem
- Boundedness of a type of iterative sequences in two-dimensional quadratic programming
- Global optimality conditions for quadratic \(0-1\) optimization problems
- Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
- Block pivoting and shortcut strategies for detecting copositivity
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
- scientific article; zbMATH DE number 4018776 (Why is no real title available?)
- scientific article; zbMATH DE number 5694287 (Why is no real title available?)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- A Global Optimization Algorithm for Concave Quadratic Programming Problems
- Copositive realxation for genera quadratic programming
- Linear convergence of a type of iterative sequences in nonconvex quadratic programming
- scientific article; zbMATH DE number 764402 (Why is no real title available?)
- Algorithme quadratique de calcul de la solution générale d'équations en mots à une variable
- An efficient algorithm for computing the roots of general quadratic, cubic and quartic equations
- On a solution method in indefinite quadratic programming under linear constraints
- Properties of two DC algorithms in quadratic programming
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- A new bound-and-reduce approach of nonconvex quadratic programming problems
- Box-constrained quadratic programs with fixed charge variables
- A computational comparison of some branch and bound methods for indefinite quadratic programs
- Global optimality conditions for some classes of optimization problems
This page was built for publication: A finite algorithm for solving general quadratic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315437)
