@prefix azonOnto: <http://id.e-science.pl/ontologies/azonOnto#> .
@prefix collection: <http://id.e-science.pl/vocab/collection/> .
@prefix dcterms: <http://purl.org/dc/terms/> .
@prefix kv: <http://id.e-science.pl/vocab/kv/> .
@prefix person: <http://id.e-science.pl/vocab/person/> .
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix records: <http://id.e-science.pl/records/> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix unit: <http://id.e-science.pl/vocab/unit/> .
@prefix xml: <http://www.w3.org/XML/1998/namespace> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

records:82845 a azonOnto:Article ;
    azonOnto:acceptanceDate "2023-01-16"^^xsd:date ;
    azonOnto:authorInfo [ a azonOnto:AuthorInfo ;
            azonOnto:affiliation unit:6165 ;
            azonOnto:author person:17080 ;
            azonOnto:position 1 ] ;
    azonOnto:collection collection:5 ;
    azonOnto:description "In this paper we restrict ourselves on polyoptimization tasks, where two criteria should assume values as large as possible (maximum task). We are interested in all efficient points in the sense of Pareto, that means in vector halforder. In this paper we pose the question, on which trajectories (directions) in the criteria-space we can approach a given but arbitrary efficient point. This is obviously of interest for the design of seeking steps.  Here we intend to bring together the two features „locally relevant control” and „reachability” of efficient points to have a possibility to evaluate the quality of existing seeking procedures. With these global features we compare the 3 methods „antiparallel gradient method”, „stochastic seeking with relatively efficient points” and „partial gain method” with each other and make concrete proposals to better these methods."@en ;
    azonOnto:destinationGroup "naukowcy"@pl,
        "studenci"@pl,
        "uczniowie"@pl ;
    azonOnto:fileInfo [ a azonOnto:FileInfo ;
            azonOnto:name "PN-1979-17-03.docx"^^xsd:string ;
            azonOnto:uri "https://data.e-science.pl/82845/PN-1979-17-03.docx"^^xsd:anyURI ],
        [ a azonOnto:FileInfo ;
            azonOnto:name "PN-1979-17-03.pdf"^^xsd:string ;
            azonOnto:uri "https://data.e-science.pl/82845/PN-1979-17-03.pdf"^^xsd:anyURI ] ;
    azonOnto:harmfulContent false ;
    azonOnto:keywordInfo [ a azonOnto:KeywordInfo ;
            azonOnto:name "gradient optimization algorithm"@en ;
            azonOnto:uri "http://id.e-science.pl/vocab/kv/47111"^^xsd:anyURI ],
        [ a azonOnto:KeywordInfo ;
            azonOnto:name "Pareto optimality"@en ;
            azonOnto:uri "http://id.e-science.pl/vocab/kv/48341"^^xsd:anyURI ],
        [ a azonOnto:KeywordInfo ;
            azonOnto:name "optymalizacja gradientowa"@pl ;
            azonOnto:uri "http://id.e-science.pl/vocab/kv/c70288"^^xsd:anyURI ],
        [ a azonOnto:KeywordInfo ;
            azonOnto:name "optymalność w sensie Pareto"@pl ;
            azonOnto:uri "http://id.e-science.pl/vocab/kv/48257"^^xsd:anyURI ] ;
    azonOnto:language "Angielski"^^xsd:string ;
    azonOnto:licenseInfo [ a azonOnto:LicenseInfo ;
            azonOnto:name "CC BY-SA 4.0"^^xsd:string ;
            azonOnto:uri "https://creativecommons.org/licenses/by-sa/4.0/legalcode.pl"^^xsd:anyURI ] ;
    azonOnto:origin "AZON2"^^xsd:string ;
    azonOnto:pageFrom 1 ;
    azonOnto:pageTo 15 ;
    azonOnto:partner [ a azonOnto:Organization ;
            azonOnto:name "Instytut Badań Systemowych PAN w Warszawie"^^xsd:string ] ;
    azonOnto:publicationYear 1979 ;
    azonOnto:publisher "IBSPAN"^^xsd:string ;
    azonOnto:scientificDiscipline "dziedzina nauk technicznych / automatyka i robotyka (2011)"@pl ;
    azonOnto:source [ a azonOnto:Source ;
            azonOnto:title "PN-1979-17-03"@en ] ;
    azonOnto:submitter [ a azonOnto:Person ;
            azonOnto:name "Anna Wasilewska"^^xsd:string ] ;
    azonOnto:title "Procedings of the seminar on non-conventional problems of optimization * Comparison of seeking process for efficient points in poly-optimization tasks with global peatures of relevant controls * Part II. (PN-1979-17-03)"@en .

RDF/XML

TURTLE

JSON-LD