Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (Q6166654): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-023-00485-0 / 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: Hidden conic quadratic representation of some nonconvex quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hidden convexity in some nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic resource allocation with generalized upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Portfolio Liquidation with Distress Risk / 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: Globally solving nonconvex quadratic programming problems via completely positive programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal deleveraging with nonlinear temporary price impact / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical Results and Efficient Algorithm for Optimal Portfolio Deleveraging with Market Impact / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: A breakpoint search approach for convex resource allocation problems with bounded variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breakpoint searching algorithms for the continuous quadratic knapsack problem / 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: Necessary conditions for ε-optimality / 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: A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of concave knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxation and nonconvex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Massively Parallel Algorithms for Singly Constrained Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of the S-Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Projection for the Multicommodity Network Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational development of a lagrangian dual approach for quadratic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating quadratic programming with bound and quadratic constraints / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-023-00485-0 / rank
 
Normal rank

Latest revision as of 19:04, 30 December 2024

scientific article; zbMATH DE number 7722198
Language Label Description Also known as
English
Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
scientific article; zbMATH DE number 7722198

    Statements

    Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 August 2023
    0 references
    separable nonconvex quadratic program
    0 references
    Lagrangian breakpoint search
    0 references
    successive convex optimization
    0 references
    convex relaxation
    0 references
    branch-and-bound
    0 references

    Identifiers