{"id":"https://openalex.org/W2162147932","doi":null,"title":"Maximizing a Sum of Sigmoids","display_name":"Maximizing a Sum of Sigmoids","alternate_titles":[],"publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2162147932","mag":"2162147932"},"language":"en","primary_location":{"id":"mag:2162147932","doi":null,"is_oa":false,"landing_page_url":"https://people.orie.cornell.edu/mru8/doc/max_sum_sigmoids.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2162147932"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5084564811","display_name":"Madeleine R Udell","orcid":"https://orcid.org/0000-0002-3985-915X","observed_orcids":["https://orcid.org/0000-0002-3985-915X"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Madeleine Udell","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5011176205","display_name":"Stephen Boyd","orcid":"https://orcid.org/0000-0001-8353-6000","observed_orcids":["https://orcid.org/0000-0001-8353-6000"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Stephen Boyd","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-8353-6000","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.9396,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.97474892,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.7886000275611877,"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.7886000275611877,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1809999942779541,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.004900000058114529,"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/sigmoidal-function","display_name":"sigmoidal function","score":0.6800000071525574},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.8700000047683716},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.7459999918937683},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.9959999918937683},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"convex optimization","score":0.8600000143051147},{"id":"https://openalex.org/keywords/network-bandwidth-allocation","display_name":"network bandwidth allocation","score":0.9240000247955322},{"id":"https://openalex.org/keywords/revenue-optimization","display_name":"revenue optimization","score":0.9950000047683716},{"id":"https://openalex.org/keywords/optimal-bidding","display_name":"optimal bidding","score":0.9950000047683716},{"id":"https://openalex.org/keywords/2008-us-presidential-election","display_name":"2008 presidential election","score":0.8080000281333923}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6994913816452026},{"id":"https://openalex.org/C9233905","wikidata":"https://www.wikidata.org/wiki/Q3276328","display_name":"Bidding","level":2,"score":0.5384893417358398},{"id":"https://openalex.org/C81388566","wikidata":"https://www.wikidata.org/wiki/Q526668","display_name":"Sigmoid function","level":3,"score":0.5254541635513306},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5241513252258301},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4730234146118164},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40221279859542847},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3791303038597107},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.12739551067352295},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.11753889918327332},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10301011800765991},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"mag:2162147932","doi":null,"is_oa":false,"landing_page_url":"https://people.orie.cornell.edu/mru8/doc/max_sum_sigmoids.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.369.1065","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.369.1065","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stanford.edu/~udell/doc/max_sum_sigmoids.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.697.297","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.697.297","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://stanford.edu/%7Eboyd/papers/pdf/max_sum_sigmoids.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.699.5817","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.699.5817","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.stanford.edu/%7Eudell/doc/max_sum_sigmoids.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W10227180","https://openalex.org/W48802902","https://openalex.org/W588386322","https://openalex.org/W1540474102","https://openalex.org/W1564025554","https://openalex.org/W1594936623","https://openalex.org/W1967073510","https://openalex.org/W1967184028","https://openalex.org/W1967344706","https://openalex.org/W1988622494","https://openalex.org/W1990313671","https://openalex.org/W1999913571","https://openalex.org/W2004407575","https://openalex.org/W2014328192","https://openalex.org/W2019025561","https://openalex.org/W2021291089","https://openalex.org/W2027049731","https://openalex.org/W2036454494","https://openalex.org/W2041946752","https://openalex.org/W2050339136","https://openalex.org/W2053427412","https://openalex.org/W2053651631","https://openalex.org/W2078358924","https://openalex.org/W2081254453","https://openalex.org/W2081553388","https://openalex.org/W2085457376","https://openalex.org/W2098968017","https://openalex.org/W2103496339","https://openalex.org/W2105198154","https://openalex.org/W2130515279","https://openalex.org/W2133469585","https://openalex.org/W2144931885","https://openalex.org/W2146489710","https://openalex.org/W2296319761","https://openalex.org/W2297878663","https://openalex.org/W2301746362","https://openalex.org/W2401610261","https://openalex.org/W2402203281","https://openalex.org/W2498144272","https://openalex.org/W2503361011","https://openalex.org/W2606353456","https://openalex.org/W2611804663","https://openalex.org/W3126091484","https://openalex.org/W3149604617"],"related_works":["https://openalex.org/W2593067562","https://openalex.org/W7096333227","https://openalex.org/W596538300","https://openalex.org/W2003266683","https://openalex.org/W7162260222","https://openalex.org/W2293329963","https://openalex.org/W6869665","https://openalex.org/W195863404","https://openalex.org/W14781978","https://openalex.org/W4226135300"],"abstract_inverted_index":{"The":[0],"problem":[1,51,68],"of":[2,6,24,59,104,110],"maximizing":[3],"a":[4,10,77,84],"sum":[5],"sigmoidal":[7,49],"functions":[8],"over":[9],"convex":[11],"constraint":[12],"set":[13],"arises":[14,56],"in":[15,33,57,124],"many":[16],"application":[17,61],"areas.":[18,62],"This":[19],"objective":[20],"captures":[21],"the":[22,48,66,90,108,115,122,125],"idea":[23],"decreasing":[25],"marginal":[26],"returns":[27],"to":[28,82,89,131],"investment,":[29],"and":[30,43,52,71,79],"has":[31],"applications":[32],"mathematical":[34],"marketing,":[35],"net-work":[36],"bandwidth":[37],"allocation,":[38],"revenue":[39],"optimization,":[40],"optimal":[41,86,116],"bidding,":[42],"lottery":[44],"design.":[45],"We":[46,63,92],"define":[47],"programming":[50],"show":[53,64,93],"how":[54],"it":[55],"each":[58],"these":[60],"that":[65,94],"general":[67],"is":[69],"NP-hard,":[70],"propose":[72],"an":[73],"ap-proximation":[74],"algorithm":[75,96],"(using":[76],"branch":[78],"bound":[80],"method)":[81],"find":[83],"globally":[85],"approximate":[87,98],"solution":[88],"problem.":[91],"this":[95,111],"finds":[97],"solutions":[99],"very":[100],"quickly":[101],"on":[102],"problems":[103],"interest.":[105],"To":[106],"illustrate":[107],"power":[109],"approach,":[112],"we":[113],"compute":[114],"positions":[117],"which":[118],"might":[119],"have":[120],"allowed":[121],"candidates":[123],"2008":[126],"United":[127],"States":[128],"presidential":[129],"election":[130],"maximize":[132],"their":[133],"vote":[134],"shares.":[135],"1":[136]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2162147932","counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5}],"updated_date":"2026-11-19T14:11:59.513116","created_date":"2016-06-24T00:00:00"}
