On the Numbers of Connected Components in the Solution Sets of Polynomial Vector Variational Inequalities View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2019-04

AUTHORS

Vu Trung Hieu

ABSTRACT

In this paper, we establish explicit upper bounds for the number of connected components in the proper Pareto solution sets and the weak Pareto solution sets of polynomial vector variational inequalities. Consequently, upper bounds for the numbers of connected components in the stationary point sets, the proper stationary point sets, and the weak Pareto solution sets of polynomial vector optimization problems are obtained. More... »

PAGES

95-100

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s10957-018-1450-y

DOI

http://dx.doi.org/10.1007/s10957-018-1450-y

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1110152925


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0101", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Pure Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "name": [
            "Division of Mathematics, Phuong Dong University, 171 Trung Kinh Street, Cau Giay, Hanoi, Vietnam"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Hieu", 
        "givenName": "Vu Trung", 
        "id": "sg:person.011366051016.37", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011366051016.37"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1016/s0362-546x(97)00578-6", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1035445490"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1080/02331934.2010.505650", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1041462754"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/15m1041134", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062874141"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2019-04", 
    "datePublishedReg": "2019-04-01", 
    "description": "In this paper, we establish explicit upper bounds for the number of connected components in the proper Pareto solution sets and the weak Pareto solution sets of polynomial vector variational inequalities. Consequently, upper bounds for the numbers of connected components in the stationary point sets, the proper stationary point sets, and the weak Pareto solution sets of polynomial vector optimization problems are obtained.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/s10957-018-1450-y", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1044187", 
        "issn": [
          "0022-3239", 
          "1573-2878"
        ], 
        "name": "Journal of Optimization Theory and Applications", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "1", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "181"
      }
    ], 
    "name": "On the Numbers of Connected Components in the Solution Sets of Polynomial Vector Variational Inequalities", 
    "pagination": "95-100", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "ef4cca4f2fbda4629e47a99a4234ab87cc91aeddcd2f3dac77d39e538be0942a"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s10957-018-1450-y"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1110152925"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s10957-018-1450-y", 
      "https://app.dimensions.ai/details/publication/pub.1110152925"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-11T11:16", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000354_0000000354/records_11691_00000002.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://link.springer.com/10.1007%2Fs10957-018-1450-y"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s10957-018-1450-y'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s10957-018-1450-y'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s10957-018-1450-y'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s10957-018-1450-y'


 

This table displays all metadata directly associated to this object as RDF triples.

69 TRIPLES      21 PREDICATES      30 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s10957-018-1450-y schema:about anzsrc-for:01
2 anzsrc-for:0101
3 schema:author Na836de76e8a847d0bf284b0cd3e5f397
4 schema:citation https://doi.org/10.1016/s0362-546x(97)00578-6
5 https://doi.org/10.1080/02331934.2010.505650
6 https://doi.org/10.1137/15m1041134
7 schema:datePublished 2019-04
8 schema:datePublishedReg 2019-04-01
9 schema:description In this paper, we establish explicit upper bounds for the number of connected components in the proper Pareto solution sets and the weak Pareto solution sets of polynomial vector variational inequalities. Consequently, upper bounds for the numbers of connected components in the stationary point sets, the proper stationary point sets, and the weak Pareto solution sets of polynomial vector optimization problems are obtained.
10 schema:genre research_article
11 schema:inLanguage en
12 schema:isAccessibleForFree false
13 schema:isPartOf N80f07549207b44bcb2c704412bf75e06
14 Nb8321133c3de48aeb3637eac8cb7e1ef
15 sg:journal.1044187
16 schema:name On the Numbers of Connected Components in the Solution Sets of Polynomial Vector Variational Inequalities
17 schema:pagination 95-100
18 schema:productId N23aec865cee0461ea1a62d8e6765d9b6
19 Nac886de3b7644f548295906bbade15e5
20 Nd290263e44164b54b4d7e29e67cbf01d
21 schema:sameAs https://app.dimensions.ai/details/publication/pub.1110152925
22 https://doi.org/10.1007/s10957-018-1450-y
23 schema:sdDatePublished 2019-04-11T11:16
24 schema:sdLicense https://scigraph.springernature.com/explorer/license/
25 schema:sdPublisher Nf67e38778e3f4b2aa9f794a25cb14544
26 schema:url https://link.springer.com/10.1007%2Fs10957-018-1450-y
27 sgo:license sg:explorer/license/
28 sgo:sdDataset articles
29 rdf:type schema:ScholarlyArticle
30 N23aec865cee0461ea1a62d8e6765d9b6 schema:name readcube_id
31 schema:value ef4cca4f2fbda4629e47a99a4234ab87cc91aeddcd2f3dac77d39e538be0942a
32 rdf:type schema:PropertyValue
33 N80f07549207b44bcb2c704412bf75e06 schema:issueNumber 1
34 rdf:type schema:PublicationIssue
35 Na23961bddeea40efaab0c6fc0f2c02c9 schema:name Division of Mathematics, Phuong Dong University, 171 Trung Kinh Street, Cau Giay, Hanoi, Vietnam
36 rdf:type schema:Organization
37 Na836de76e8a847d0bf284b0cd3e5f397 rdf:first sg:person.011366051016.37
38 rdf:rest rdf:nil
39 Nac886de3b7644f548295906bbade15e5 schema:name dimensions_id
40 schema:value pub.1110152925
41 rdf:type schema:PropertyValue
42 Nb8321133c3de48aeb3637eac8cb7e1ef schema:volumeNumber 181
43 rdf:type schema:PublicationVolume
44 Nd290263e44164b54b4d7e29e67cbf01d schema:name doi
45 schema:value 10.1007/s10957-018-1450-y
46 rdf:type schema:PropertyValue
47 Nf67e38778e3f4b2aa9f794a25cb14544 schema:name Springer Nature - SN SciGraph project
48 rdf:type schema:Organization
49 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
50 schema:name Mathematical Sciences
51 rdf:type schema:DefinedTerm
52 anzsrc-for:0101 schema:inDefinedTermSet anzsrc-for:
53 schema:name Pure Mathematics
54 rdf:type schema:DefinedTerm
55 sg:journal.1044187 schema:issn 0022-3239
56 1573-2878
57 schema:name Journal of Optimization Theory and Applications
58 rdf:type schema:Periodical
59 sg:person.011366051016.37 schema:affiliation Na23961bddeea40efaab0c6fc0f2c02c9
60 schema:familyName Hieu
61 schema:givenName Vu Trung
62 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011366051016.37
63 rdf:type schema:Person
64 https://doi.org/10.1016/s0362-546x(97)00578-6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1035445490
65 rdf:type schema:CreativeWork
66 https://doi.org/10.1080/02331934.2010.505650 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041462754
67 rdf:type schema:CreativeWork
68 https://doi.org/10.1137/15m1041134 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062874141
69 rdf:type schema:CreativeWork
 




Preview window. Press ESC to close (or click here)


...