DC programming approaches for discrete portfolio optimization under concave transaction costs (Q5963231): Difference between revisions

From MaRDI portal
Added link to MaRDI 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: CPLEX / 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-015-0931-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1462197815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the portfolio selection problem with minimum transaction lots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting portfolios with fixed costs and minimum transaction lots / 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: Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization versus integer programming in portfolio optimization under nonconvex transaction costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming approaches in mean-risk models / 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: Genetic algorithms for portfolio selection problems with minimum transaction lots / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed computation algorithm for solving portfolio problems with integer variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuous approach for the concave cost supply problem via DC programming and DCA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuous approach to nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on ``A continuous approach to nonlinear integer programming'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalty in d. c. programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalty and error bounds in DC programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Linear Programming Via Penalty Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC Programming and DCA for General DC Programs / rank
 
Normal rank

Latest revision as of 12:52, 11 July 2024

scientific article; zbMATH DE number 6550152
Language Label Description Also known as
English
DC programming approaches for discrete portfolio optimization under concave transaction costs
scientific article; zbMATH DE number 6550152

    Statements

    DC programming approaches for discrete portfolio optimization under concave transaction costs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 March 2016
    0 references
    portfolio optimization
    0 references
    DC programming
    0 references
    DCA
    0 references
    branch and bound
    0 references
    DC relaxation
    0 references
    concave transaction costs
    0 references
    nonconvex integer program
    0 references
    0 references
    0 references

    Identifiers