A finite algorithm for solving general quadratic problems
From MaRDI portal
Recommendations
Cites work
- 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?)
- 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
- 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
(25)- A Global Optimization Algorithm for Concave Quadratic Programming Problems
- Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
- A new algorithm for solving the general quadratic programming problem
- Box-constrained quadratic programs with fixed charge variables
- Global optimality conditions for some classes of optimization problems
- Necessary and sufficient global optimality conditions for convex maximization revisited
- Global optimality conditions for quadratic \(0-1\) optimization problems
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- scientific article; zbMATH DE number 764402 (Why is no real title available?)
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
- Properties of two DC algorithms in quadratic programming
- Boundedness of a type of iterative sequences in two-dimensional quadratic programming
- Block pivoting and shortcut strategies for detecting copositivity
- scientific article; zbMATH DE number 4018776 (Why is no real title available?)
- Algorithme quadratique de calcul de la solution générale d'équations en mots à une variable
- A computational comparison of some branch and bound methods for indefinite quadratic programs
- Linear convergence of a type of iterative sequences in nonconvex quadratic programming
- 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
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- A new bound-and-reduce approach of nonconvex quadratic programming problems
- Copositive realxation for genera quadratic programming
- An improved algorithm for quadratic equation classification and Petrov classification
- scientific article; zbMATH DE number 5694287 (Why is no real title available?)
- Optimality conditions and optimization methods for quartic polynomial optimization
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)
