{"id":"https://openalex.org/W2131081048","doi":"https://doi.org/10.1109/iccv.2007.4409087","title":"Efficient optimization for L&lt;sub&gt;&amp;#x0221E;&lt;/sub&gt;-problems using pseudoconvexity","display_name":"Efficient optimization for L&lt;sub&gt;&amp;#x0221E;&lt;/sub&gt;-problems using pseudoconvexity","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2131081048","doi":"https://doi.org/10.1109/iccv.2007.4409087","mag":"2131081048"},"language":"en","primary_location":{"id":"doi:10.1109/iccv.2007.4409087","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccv.2007.4409087","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE 11th International Conference on Computer Vision","raw_type":"proceedings-article"},"type":"conference-paper","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/A5101505222","display_name":"Carl Olsson","orcid":"https://orcid.org/0000-0003-3545-7695"},"institutions":[{"id":"https://openalex.org/I1279596006","display_name":"Statistics Sweden","ror":"https://ror.org/05x7wz523","country_code":"SE","type":"government","lineage":["https://openalex.org/I1279596006"]},{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Carl Olsson","raw_affiliation_strings":["Centre for Mathematical Sciences, Lund University, Sweden","Lund University, Lund#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Mathematical Sciences, Lund University, Sweden","institution_ids":["https://openalex.org/I1279596006","https://openalex.org/I187531555"]},{"raw_affiliation_string":"Lund University, Lund#TAB#","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069883194","display_name":"Anders Eriksson","orcid":"https://orcid.org/0000-0003-2652-7110"},"institutions":[{"id":"https://openalex.org/I1279596006","display_name":"Statistics Sweden","ror":"https://ror.org/05x7wz523","country_code":"SE","type":"government","lineage":["https://openalex.org/I1279596006"]},{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Anders P. Eriksson","raw_affiliation_strings":["Centre for Mathematical Sciences, Lund University, Sweden","Lund University, Lund#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Mathematical Sciences, Lund University, Sweden","institution_ids":["https://openalex.org/I1279596006","https://openalex.org/I187531555"]},{"raw_affiliation_string":"Lund University, Lund#TAB#","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044691312","display_name":"Fredrik Kahl","orcid":null},"institutions":[{"id":"https://openalex.org/I1279596006","display_name":"Statistics Sweden","ror":"https://ror.org/05x7wz523","country_code":"SE","type":"government","lineage":["https://openalex.org/I1279596006"]},{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Fredrik Kahl","raw_affiliation_strings":["Centre for Mathematical Sciences, Lund University, Sweden","Lund University, Lund#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Mathematical Sciences, Lund University, Sweden","institution_ids":["https://openalex.org/I1279596006","https://openalex.org/I187531555"]},{"raw_affiliation_string":"Lund University, Lund#TAB#","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9987000226974487,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/bisection-method","display_name":"Bisection method","score":0.592575192451477},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5434187054634094},{"id":"https://openalex.org/keywords/bisection","display_name":"Bisection","score":0.5422916412353516},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5024023056030273},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.48808753490448},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4791550040245056},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.4714523255825043},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4434278905391693},{"id":"https://openalex.org/keywords/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.4427790939807892},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4228513836860657},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40554988384246826}],"concepts":[{"id":"https://openalex.org/C157544257","wikidata":"https://www.wikidata.org/wiki/Q866300","display_name":"Bisection method","level":2,"score":0.592575192451477},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5434187054634094},{"id":"https://openalex.org/C31599958","wikidata":"https://www.wikidata.org/wiki/Q3128632","display_name":"Bisection","level":2,"score":0.5422916412353516},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5024023056030273},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.48808753490448},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4791550040245056},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.4714523255825043},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4434278905391693},{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.4427790939807892},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4228513836860657},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40554988384246826},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iccv.2007.4409087","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccv.2007.4409087","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE 11th International Conference on Computer Vision","raw_type":"proceedings-article"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/57036","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/57036","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dx.doi.org/10.1109/iccv.2007.4409087","raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320940","display_name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning","ror":"https://ror.org/044wr7g58"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W258481170","https://openalex.org/W1508335918","https://openalex.org/W1967073510","https://openalex.org/W2033819227","https://openalex.org/W2041708912","https://openalex.org/W2048153145","https://openalex.org/W2140510563","https://openalex.org/W2144275687","https://openalex.org/W2158309416","https://openalex.org/W2161220183","https://openalex.org/W2185122847","https://openalex.org/W2296319761","https://openalex.org/W2787523326","https://openalex.org/W4250589301","https://openalex.org/W6660894886","https://openalex.org/W6681406663","https://openalex.org/W6683395060","https://openalex.org/W6686117621","https://openalex.org/W7058398353"],"related_works":["https://openalex.org/W2329494729","https://openalex.org/W3112697985","https://openalex.org/W41290553","https://openalex.org/W2585516632","https://openalex.org/W1986919722","https://openalex.org/W2093663313","https://openalex.org/W40332083","https://openalex.org/W4296983618","https://openalex.org/W2158390333","https://openalex.org/W2577097539"],"abstract_inverted_index":{"In":[0,92],"this":[1,93],"paper":[2,94],"we":[3,95],"consider":[4],"the":[5,13,41,46,74,102,132,158,162,168,172,187],"problem":[6],"of":[7,34,48,89,100,119,134,178],"solving":[8],"geometric":[9],"reconstruction":[10],"problems":[11,196],"with":[12,199],"L":[14,75],"<sub":[15,76],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[16,77],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u221e</sub>":[17,78],"-norm.":[18],"Previous":[19],"work":[20],"has":[21],"shown":[22],"that":[23,118,156],"globally":[24],"optimal":[25],"solutions":[26,42],"can":[27,64],"be":[28,65],"computed":[29],"reliably":[30],"for":[31,39,110,139,194],"a":[32,57,60,68,83,87,111,123,176],"series":[33],"such":[35,146],"problems.":[36,91,180],"The":[37,128,148],"methods":[38,138],"computing":[40,101],"have":[43],"relied":[44],"on":[45,191],"property":[47,116],"quasiconvexity.":[49,127],"For":[50],"quasiconvex":[51],"problems,":[52],"checking":[53],"if":[54],"there":[55],"exists":[56],"solution":[58],"below":[59],"certain":[61],"objective":[62],"value":[63],"posed":[66],"as":[67],"convex":[69,90],"feasibility":[70],"problem.":[71],"To":[72],"solve":[73],"-problem":[79],"one":[80,150,164],"typically":[81],"employs":[82],"bisection":[84,169,189],"algorithm,":[85],"generating":[86],"sequence":[88,177],"present":[96,144],"more":[97,140],"efficient":[98,141],"ways":[99],"solutions.":[103],"We":[104,143],"derive":[105],"necessary":[106],"and":[107,161,184,197],"sufficient":[108],"conditions":[109,160],"global":[112],"optimum.":[113],"A":[114],"key":[115],"is":[117,122,151,165],"pseudoconvexity,":[120],"which":[121],"stronger":[124],"condition":[125],"than":[126],"results":[129],"open":[130],"up":[131],"possibility":[133],"using":[135],"local":[136],"optimization":[137],"computations.":[142],"two":[145],"algorithms.":[147],"first":[149],"an":[152],"interior":[153],"point":[154],"method":[155,170],"uses":[157],"KKT":[159],"second":[163],"similar":[166],"to":[167,186],"in":[171],"sense":[173],"it":[174],"solves":[175],"SOCP":[179],"Results":[181],"are":[182],"presented":[183],"compared":[185],"standard":[188],"algorithm":[190],"real":[192],"data":[193],"various":[195],"scenarios":[198],"improved":[200],"performance.":[201]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}