Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-018-0617-2 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Biq Mac / rank
 
Normal rank
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.1007/s10898-018-0617-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2788980057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem / 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: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of functions having Lipschitz continuous first partial derivatives / 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: Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster, but weaker, relaxations for quadratically constrained quadratic programs / 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: Semidefinite programming relaxation for nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming in combinatorial optimization / 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: Inexact subgradient methods for quasi-convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2812260 / 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: KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Trust Region Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / 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: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing RLT relaxations via a new class of semidefinite cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cones of Nonnegative Quadratic Functions / 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: Semidefinite Programming / 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: Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation / 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 / DOI
 
Property / DOI: 10.1007/S10898-018-0617-2 / rank
 
Normal rank

Latest revision as of 01:47, 10 December 2024

scientific article
Language Label Description Also known as
English
Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
scientific article

    Statements

    Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (English)
    0 references
    0 references
    0 references
    18 July 2018
    0 references
    nonconvex quadratically constrained quadratic program
    0 references
    Lagrangian dual optimization
    0 references
    semidefinite program relaxation
    0 references
    subgradient method
    0 references
    quasi-convex function
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers