Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.3934/jimo.2017064 / 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: 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 the copositive representation of binary and continuous nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing a polyhedral-semidefinite relaxation of completely positive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal point algorithm for nonlinear complementarity problem based on the generalized Fischer-Burmeister merit function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of membership problems for the completely positive cone and its dual / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering and Economic Applications of Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trust-region filter-SQP method for mathematical programs with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints / 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: Convergence of optimal values of quadratic penalty problems for mathematical programs with complementarity constraints / 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: The Linear-Quadratic Bilevel Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex reformulation for binary quadratic programming problems via average objective value maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fritz John necessary optimality conditions in the presence of equality and inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of uniqueness and local search in quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating direction augmented Lagrangian methods for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton-CG Augmented Lagrangian Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic approximation to quadratic optimization with linear complementarity constraints / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.3934/JIMO.2017064 / rank
 
Normal rank

Latest revision as of 05:52, 11 December 2024

scientific article
Language Label Description Also known as
English
Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming
scientific article

    Statements

    Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 February 2019
    0 references
    quadratic programs with complementarity constraints
    0 references
    augmented Lagrangian method
    0 references
    branch and bound
    0 references
    doubly nonnegative relaxation
    0 references
    semidefinite programming
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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