Quadratic Convex Reformulations for Semicontinuous Quadratic Programming (Q5348460): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Xiao Jin Zheng / rank
Normal rank
 
Property / author
 
Property / author: Xiao Jin Zheng / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1507.05708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong conic quadratic reformulation for machine-job assignment with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4863586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for cardinality-constrained quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of a family of mixed-integer quadratic programming problems / 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: Extending the QCR method to general mixed-integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations / 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: The Optimal Selection of Small Portfolios / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and nonlinear optimization. Theory and examples. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspective Reformulations of the CTA Problem with <i>L</i><sub>2</sub> Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for cardinality constrained portfolio optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing for complex portfolio selection problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Lagrangian relaxation for general quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Portfolio selection using neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximated perspective relaxations: a project and lift approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspective cuts for a class of convex 0-1 mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints / 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: A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected Perspective Reformulations with Applications in Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Cardinality Constrained Portfolio Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Implementations for Nonsmooth Convex Programs / 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: Q5613011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of cardinality constrained portfolios with a hybrid local search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4806224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot sizing with minimum order quantity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian relaxation procedure for cardinality-constrained portfolio optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in mathematical programming with semi-continuous variables and cardinality constraint / 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
Property / OpenAlex ID
 
Property / OpenAlex ID: W3098275687 / rank
 
Normal rank

Latest revision as of 09:39, 30 July 2024

scientific article; zbMATH DE number 6760750
Language Label Description Also known as
English
Quadratic Convex Reformulations for Semicontinuous Quadratic Programming
scientific article; zbMATH DE number 6760750

    Statements

    Quadratic Convex Reformulations for Semicontinuous Quadratic Programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 August 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    mixed-integer quadratic programming
    0 references
    semicontinuous quadratic program
    0 references
    perspective cut reformulation
    0 references
    quadratic convex reformulation
    0 references
    semidefinite program
    0 references
    portfolio selection
    0 references
    subset selection
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references