乐胖代购免代理版

{"id":"https://openalex.org/W2019266326","doi":"https://doi.org/10.1080/10556788.2012.737327","title":"Hessian distances and their applications in the complexity analysis of interior-point methods","display_name":"Hessian distances and their applications in the complexity analysis of interior-point methods","publication_year":2012,"publication_date":"2012-10-23","ids":{"openalex":"https://openalex.org/W2019266326","doi":"https://doi.org/10.1080/10556788.2012.737327","mag":"2019266326"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2012.737327","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067792459","display_name":"Yurii Nesterov","orcid":"https://orcid.org/0000-0002-0542-8757"},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"funder","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Yurii Nesterov","raw_affiliation_strings":["CORE and INMA, Universit$#xE9; Catholique de Louvain, 34, voie du Roman Pays, Louvain-la-Neuve, 1348, Belgium#TAB#"],"affiliations":[{"raw_affiliation_string":"CORE and INMA, Universit$#xE9; Catholique de Louvain, 34, voie du Roman Pays, Louvain-la-Neuve, 1348, Belgium#TAB#","institution_ids":["https://openalex.org/I95674353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002322690","display_name":"Yu Xia","orcid":"https://orcid.org/0000-0002-5212-0931"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"funder","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Yu Xia","raw_affiliation_strings":["(School of Mathematics, University of Birmingham, Birmingham, UK)"],"affiliations":[{"raw_affiliation_string":"(School of Mathematics, University of Birmingham, Birmingham, UK)","institution_ids":["https://openalex.org/I79619799"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":64},"biblio":{"volume":"28","issue":"3","first_page":"543","last_page":"563"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9971,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9894,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.9180699},{"id":"https://openalex.org/keywords/hessian-matrix","display_name":"Hessian matrix","score":0.9049694},{"id":"https://openalex.org/keywords/conic-section","display_name":"Conic section","score":0.8396275}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.9180699},{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.9049694},{"id":"https://openalex.org/C108598597","wikidata":"https://www.wikidata.org/wiki/Q124255","display_name":"Conic section","level":2,"score":0.8396275},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.6452948},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.58998007},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5840156},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.566669},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42260587},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4208964},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3847864},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33867538},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33588654},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.17726612},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.13952947},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2012.737327","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.64,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":16,"referenced_works":["https://openalex.org/W1493426390","https://openalex.org/W1509805685","https://openalex.org/W1518039036","https://openalex.org/W1632601927","https://openalex.org/W1986106357","https://openalex.org/W1999031104","https://openalex.org/W2035484941","https://openalex.org/W2061981434","https://openalex.org/W2077274614","https://openalex.org/W2082556624","https://openalex.org/W2094652559","https://openalex.org/W2114408464","https://openalex.org/W2117065890","https://openalex.org/W2120478422","https://openalex.org/W2124541940","https://openalex.org/W2154059477"],"related_works":["https://openalex.org/W4300566153","https://openalex.org/W3100053256","https://openalex.org/W3017139193","https://openalex.org/W2946724620","https://openalex.org/W2804689728","https://openalex.org/W2795378890","https://openalex.org/W2377924059","https://openalex.org/W2373292822","https://openalex.org/W2037437483","https://openalex.org/W2012685253"],"abstract_inverted_index":{"For":[0],"interior":[1,65],"points":[2],"in":[3,63],"convex":[4],"cones,":[5],"we":[6,32],"introduce":[7],"the":[8,38,46,64,67,70,83,99,103,107],"Hessian":[9,100],"distance":[10,101],"function,":[11],"and":[12,48,106],"show":[13],"that":[14],"it":[15],"is":[16],"convenient":[17],"for":[18,37,77,82,88],"complexity":[19,93],"analysis":[20],"of":[21,29,66,94],"polynomial-time":[22],"interior-point":[23],"methods":[24],"(IPMs).":[25],"As":[26],"an":[27,79],"example":[28],"its":[30],"application,":[31],"develop":[33],"new":[34],"infeasible-start":[35],"IPM":[36],"linear":[39],"conic":[40],"optimization":[41],"problem.":[42],"In":[43],"our":[44],"setting,":[45],"primal":[47],"dual":[49],"cones":[50],"need":[51],"not":[52],"to":[53],"be":[54,75],"self-dual.":[55],"We":[56,110],"can":[57,74],"start":[58],"from":[59],"any":[60],"primal\u2013dual":[61],"point":[62,105],"cones.":[68],"Then,":[69],"damped":[71],"Newton's":[72],"method":[73],"used":[76],"obtaining":[78],"approximate":[80],"solution":[81],"strictly":[84],"feasible":[85],"case,":[86],"or":[87],"detecting":[89],"primal/dual":[90],"infeasibility.":[91],"The":[92],"these":[95],"cases":[96],"depends":[97],"on":[98],"between":[102],"starting":[104],"feasibility/infeasibility":[108],"certificates.":[109],"also":[111],"present":[112],"some":[113],"numerical":[114],"results.":[115]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2019266326","counts_by_year":[],"updated_date":"2025-02-01T18:47:10.454372","created_date":"2016-06-24"}