A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (Q4639134): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331934.2017.1391253 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2766089206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional QCQP With Applications in ML Steering Direction Estimation for Radar Detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Portfolio selection with marginal risk control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimality conditions for mixed nonconvex quadratic programs† / rank
 
Normal rank
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 simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplicial branch-and-bound method for solving nonconvex all-quadratic programs / 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: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second order cone programming relaxation of nonconvex quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The MILP Road to MIQCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / 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: Q3802887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex relaxations for quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic approximation to nonconvex quadratic programming with convex quadratic constraints / 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: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Cuts—A New Type of Cutting Planes for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Homotopy Principle and Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual methods for vertex and facet enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test examples for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly 3: moments, optimization and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding largest small polygons with gloptipoly / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set of geometric programming test problems and their solutions / 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
Property / cites work
 
Property / cites work: On zero duality gap in nonconvex quadratic programming problems / rank
 
Normal rank

Latest revision as of 13:54, 15 July 2024

scientific article; zbMATH DE number 6865939
Language Label Description Also known as
English
A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
scientific article; zbMATH DE number 6865939

    Statements

    A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3 May 2018
    0 references
    branch-and-cut algorithm
    0 references
    nonconvex quadratically constrained quadratic programming
    0 references
    polar cut
    0 references
    semidefinite relaxation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers