Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations (Q2826815): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
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: Globally solving nonconvex quadratic programming problems via completely positive programming / 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: Branching and bounds tighteningtechniques for non-convex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of semidefinite programs via nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSDP, A C library for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The MILP Road to MIQCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the separation of split inequalities for non-convex quadratic integer programming / 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: Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDP diagonalizations and perspective cuts for a class of nonseparable MIQP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspective reformulations of mixed integer nonlinear programs with indicator variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4668573 / 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: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block Coordinate Descent Methods for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical Models, Exponential Families, and Variational Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly unbiased variable selection under minimax concave penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach / rank
 
Normal rank

Latest revision as of 17:38, 12 July 2024

scientific article
Language Label Description Also known as
English
Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations
scientific article

    Statements

    Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations (English)
    0 references
    0 references
    0 references
    11 October 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    quadratic programming
    0 references
    convex relaxation
    0 references
    cutting-surface algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references