Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: BiqMac / 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/s10589-016-9855-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2410501318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2928409 / 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: On conic QPCCs, conic QCQPs and completely positive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations for non-convex quadratic mixed-integer programming / 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: A gentle, geometric introduction to copositive optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of quadratic programs with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems / 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: Handbook of test problems in local and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem / 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 the solution of NP-hard linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for linear programming with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties / 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: Interior Methods for Mathematical Programs with Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive computable approximation to cones of nonnegative quadratic functions / 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: Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations / 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: On Cones of Nonnegative Quadratic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Slater condition for the SDP relaxations of nonconvex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2928420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conic approximation method for the 0-1 quadratic knapsack problem / rank
 
Normal rank

Latest revision as of 21:04, 13 July 2024

scientific article
Language Label Description Also known as
English
Conic approximation to quadratic optimization with linear complementarity constraints
scientific article

    Statements

    Conic approximation to quadratic optimization with linear complementarity constraints (English)
    0 references
    0 references
    0 references
    0 references
    29 May 2017
    0 references
    cone of nonnegative quadratic functions
    0 references
    conic approximation
    0 references
    linear complementarity constraints
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers