Conic approximation to nonconvex quadratic programming with convex quadratic constraints (Q2018510): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-014-0195-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976931616 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57438369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming / 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: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-Order-Cone Constraints for Extended Trust-Region Subproblems / 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: Q3681854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive realxation for genera quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive computable approximation to cones of nonnegative quadratic functions / 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 recipe for semidefinite relaxation for \((0,1)\)-quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite framework for trust region subproblems with applications to large scale minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: State Constraints in Convex Control Problems of Bolza / rank
 
Normal rank
Property / cites work
 
Property / cites work: BARON: A general purpose global optimization software package / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cones of Nonnegative Quadratic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on Quadratic Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations / rank
 
Normal rank

Latest revision as of 21:03, 9 July 2024

scientific article
Language Label Description Also known as
English
Conic approximation to nonconvex quadratic programming with convex quadratic constraints
scientific article

    Statements

    Conic approximation to nonconvex quadratic programming with convex quadratic constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 March 2015
    0 references
    nonconvex quadratic programming
    0 references
    adaptive scheme
    0 references
    cone of nonnegative quadratic functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers