A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity (Q5084603): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A relaxation method for nonconvex quadratically constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and reduce approach for solving a class of low rank d.c. programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm for a particular D.C. quadratic programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving nonconvex quadratic programming problems via completely positive programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global solution of non-convex quadratically constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixing Variables in Semidefinite Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid LP/NLP paradigm for global optimization relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(NP\)-hardness of linear multiplicative programming and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximization of quadratic form over intersection of ellipsoids with common center / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual bounds and optimality cuts for all-quadratic programs with convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization algorithms for linearly constrained indefinite quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic programming with one negative eigenvalue is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-convexification approach for solving nonconvex quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite-quadratic-linear programs using SDPT3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving nonconvex optimization problems by reducing the duality gap / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm using Lagrangian underestimates and the interval Newton method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for indefinite quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of approximating a KKT point of quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating global quadratic optimization with convex quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating quadratic programming with bound and quadratic constraints / rank
 
Normal rank

Revision as of 12:12, 29 July 2024

scientific article; zbMATH DE number 7549339
Language Label Description Also known as
English
A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
scientific article; zbMATH DE number 7549339

    Statements

    A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity (English)
    0 references
    0 references
    0 references
    28 June 2022
    0 references
    quadratic programming
    0 references
    quadratically constrained quadratic programming
    0 references
    branch-and-bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers