{"id":"https://openalex.org/W2460623955","doi":"https://doi.org/10.1080/10556788.2016.1202246","title":"The Lyapunov rank of an improper cone","display_name":"The Lyapunov rank of an improper cone","publication_year":2016,"publication_date":"2016-07-08","ids":{"openalex":"https://openalex.org/W2460623955","doi":"https://doi.org/10.1080/10556788.2016.1202246","mag":"2460623955"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2016.1202246","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2016.1202246","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_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},"type":"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/A5011346455","display_name":"Michael Orlitzky","orcid":"https://orcid.org/0000-0002-1447-961X"},"institutions":[{"id":"https://openalex.org/I79272384","display_name":"University of Maryland, Baltimore County","ror":"https://ror.org/02qskvh78","country_code":"US","type":"education","lineage":["https://openalex.org/I79272384"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Orlitzky","raw_affiliation_strings":["Department of Mathematics and Statistics, University of Maryland Baltimore County, Baltimore, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, University of Maryland Baltimore County, Baltimore, MD, USA","institution_ids":["https://openalex.org/I79272384"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5011346455"],"corresponding_institution_ids":["https://openalex.org/I79272384"],"apc_list":null,"apc_paid":null,"fwci":0.4265,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.61219571,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"32","issue":"1","first_page":"109","last_page":"125"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9995999932289124,"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":0.9995999932289124,"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.9965000152587891,"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.9839000105857849,"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/mathematics","display_name":"Mathematics","score":0.7932519316673279},{"id":"https://openalex.org/keywords/dual-cone-and-polar-cone","display_name":"Dual cone and polar cone","score":0.7029989957809448},{"id":"https://openalex.org/keywords/convex-cone","display_name":"Convex cone","score":0.6707466840744019},{"id":"https://openalex.org/keywords/lyapunov-function","display_name":"Lyapunov function","score":0.5299293398857117},{"id":"https://openalex.org/keywords/cone","display_name":"Cone (formal languages)","score":0.49351465702056885},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4907439947128296},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4693373739719391},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.4525753855705261},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45096781849861145},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.42175763845443726},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.27219098806381226},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.18118566274642944},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.12429633736610413}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7932519316673279},{"id":"https://openalex.org/C24484764","wikidata":"https://www.wikidata.org/wiki/Q2687694","display_name":"Dual cone and polar cone","level":3,"score":0.7029989957809448},{"id":"https://openalex.org/C28340159","wikidata":"https://www.wikidata.org/wiki/Q2256541","display_name":"Convex cone","level":5,"score":0.6707466840744019},{"id":"https://openalex.org/C60640748","wikidata":"https://www.wikidata.org/wiki/Q2337858","display_name":"Lyapunov function","level":3,"score":0.5299293398857117},{"id":"https://openalex.org/C30014739","wikidata":"https://www.wikidata.org/wiki/Q5159445","display_name":"Cone (formal languages)","level":2,"score":0.49351465702056885},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4907439947128296},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4693373739719391},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.4525753855705261},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45096781849861145},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.42175763845443726},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.27219098806381226},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.18118566274642944},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.12429633736610413},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2016.1202246","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2016.1202246","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_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W256649259","https://openalex.org/W352752093","https://openalex.org/W1995249470","https://openalex.org/W2000151369","https://openalex.org/W2019854158","https://openalex.org/W2081392908","https://openalex.org/W2102229945","https://openalex.org/W2134550080","https://openalex.org/W2296319761","https://openalex.org/W4235080641","https://openalex.org/W4249667877","https://openalex.org/W4250589301"],"related_works":["https://openalex.org/W1974329054","https://openalex.org/W2043823063","https://openalex.org/W2484043914","https://openalex.org/W2184361932","https://openalex.org/W2069365182","https://openalex.org/W2068531293","https://openalex.org/W1965358437","https://openalex.org/W1971414685","https://openalex.org/W1963700989","https://openalex.org/W1599513139"],"abstract_inverted_index":{"Let":[0],"K":[1,21,34,98],"be":[2,104],"a":[3,11,27,123,142,183],"closed":[4,117,132,143,185],"convex":[5,133,144,186],"cone":[6,70,134,145],"with":[7],"dual":[8],"K\u2217":[9],"in":[10],"finite-dimensional":[12],"real":[13],"inner-product":[14],"space":[15,43,173],"V.":[16],"The":[17,39,95],"complementarity":[18,93],"set":[19],"of":[20,41,44,53,71,86,130,152,174,182],"is":[22,31,48,99],"C(K)={(x,s)\u2208K\u00d7K\u2217|\u27e8x,s\u27e9=0}.":[23],"We":[24,106,120],"say":[25],"that":[26,97,114,137],"linear":[28],"transformation":[29],"L:V\u2192V":[30],"Lyapunov-like":[32,139,176],"on":[33,141],"if":[35],"\u27e8L(x),s\u27e9=0for":[36],"all":[37,45,175],"(x,s)\u2208C(K).":[38],"dimension":[40],"the":[42,50,69,109,127,138,149,172,179],"such":[46],"transformations":[47,140,177],"called":[49],"Lyapunov":[51,128,180],"rank":[52,129,181],"K.":[54],"This":[55],"number":[56],"was":[57],"introduced":[58],"and":[59,92,118,135,178],"studied":[60],"by":[61],"Rudolf":[62],"et":[63],"al.":[64],"[Bilinear":[65],"optimality":[66],"constraints":[67],"for":[68,82,112,161],"positive":[72],"polynomials,":[73],"Math.":[74],"Program.,":[75],"Ser.":[76],"B":[77],"129":[78],"(2011),":[79],"pp.":[80],"5\u201331]":[81],"proper":[83,100,162],"cones":[84,113],"because":[85],"its":[87,153],"connection":[88],"to":[89,103,125,148,169],"conic":[90],"programming":[91],"problems.":[94],"assumption":[96],"turns":[101],"out":[102],"nonessential.":[105],"first":[107],"develop":[108],"basic":[110],"theory":[111],"are":[115,146],"merely":[116],"convex.":[119],"then":[121],"devise":[122,167],"way":[124],"compute":[126,170],"any":[131],"show":[136],"related":[147],"Lie":[150],"algebra":[151],"automorphism":[154],"group.":[155],"Next,":[156],"we":[157,166],"extend":[158],"some":[159],"results":[160],"polyhedral":[163,184],"cones.":[164],"Finally,":[165],"algorithms":[168],"both":[171],"cone.":[187]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-08-15T07:11:24.734988","created_date":"2025-10-10T00:00:00"}