A difference of convex formulation of value-at-risk constrained optimization (Q3577837): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1080/02331931003700731 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988746686 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59254965 / 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: Combination between global and local methods for solving an optimization problem over the efficient set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuous approch for globally solving linearly constrained quadratic / 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: Coherent Measures of Risk / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Portfolios with Bounded Capital at Risk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic value at risk under optimal and suboptimal portfolio policies. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4459806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC programming: overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC programming approach for portfolio optimization under step increasing transaction costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incorporating Asymmetric Distributional Information in Robust Value-at-Risk Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the global minimization of the value-at-risk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Portfolio optimization under the Value-at-Risk constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Value at risk and inventory control / rank
 
Normal rank
Property / cites work
 
Property / cites work: A firm's optimizing behaviour under a value-at-risk constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Managing electricity market price risk / rank
 
Normal rank

Latest revision as of 00:49, 3 July 2024

scientific article
Language Label Description Also known as
English
A difference of convex formulation of value-at-risk constrained optimization
scientific article

    Statements

    A difference of convex formulation of value-at-risk constrained optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 July 2010
    0 references
    stochastic programming
    0 references
    portfolio optimization
    0 references
    D.C. optimization
    0 references
    branch-and-bound
    0 references
    0 references

    Identifiers

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