Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-013-0647-0 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: SDPT3 / 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/s11590-013-0647-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989125538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the QCR method to general mixed-integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex quadratic programs with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming / 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: On the Global Solution of Linear Programs with Linear Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear programs with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LPCC approach to nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints / 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: Three modeling paradigms in mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-013-0647-0 / rank
 
Normal rank

Latest revision as of 17:01, 18 December 2024

scientific article
Language Label Description Also known as
English
Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
scientific article

    Statements

    Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (English)
    0 references
    0 references
    0 references
    0 references
    30 April 2014
    0 references
    convex quadratic program with linear complementarity constraints
    0 references
    semidefinite program
    0 references
    quadratic convex reformulation
    0 references
    quadratically constrained quadratic program
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references