Primal and dual approximation algorithms for convex vector optimization problems (Q475807): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q57612119 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1308.6809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SET-VALUED SHORTFALL AND DIVERGENCE RISK MEASURES / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual methods for vertex and facet enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Duality for Convex Vector Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation methods in multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual variant of Benson's ``outer approximation algorithm'' for multiple objective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for convex multi-objective programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the nondominated set of an MOLP by approximately solving its dual problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Implementations for Nonsmooth Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrange duality in set optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benson type algorithms for linear vector optimization and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set-valued average value at risk and its computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Duality in Multiple Objective Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution concepts in vector optimization: a fresh look at an old story / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hedging and liquidation under transaction costs in currency markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector Optimization with Infimum and Supremum / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ALGORITHM FOR CALCULATING THE SET OF SUPERHEDGING PORTFOLIOS IN MARKETS WITH TRANSACTION COSTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning / rank
 
Normal rank

Latest revision as of 09:26, 9 July 2024

scientific article
Language Label Description Also known as
English
Primal and dual approximation algorithms for convex vector optimization problems
scientific article

    Statements

    Primal and dual approximation algorithms for convex vector optimization problems (English)
    0 references
    0 references
    0 references
    0 references
    27 November 2014
    0 references
    0 references
    vector optimization
    0 references
    multiple objective optimization
    0 references
    convex programming
    0 references
    duality
    0 references
    algorithms
    0 references
    outer approximation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references