{"id":"https://openalex.org/W2632212210","doi":"https://doi.org/10.1007/s12532-018-0152-7","title":"Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra","display_name":"Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra","publication_year":2018,"publication_date":"2018-12-03","ids":{"openalex":"https://openalex.org/W2632212210","doi":"https://doi.org/10.1007/s12532-018-0152-7","mag":"2632212210"},"language":"en","primary_location":{"id":"doi:10.1007/s12532-018-0152-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12532-018-0152-7","pdf_url":null,"source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1706.05795","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008007328","display_name":"Alper Atamt\u00fcrk","orcid":"https://orcid.org/0000-0003-1220-808X"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alper Atamt\u00fcrk","raw_affiliation_strings":["Industrial Engineering & Operations Research, University of California, Berkeley, CA, 94720-1777, USA","Industrial Engineering and Operations Research, University of California, Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"Industrial Engineering & Operations Research, University of California, Berkeley, CA, 94720-1777, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Industrial Engineering and Operations Research, University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085852340","display_name":"Andr\u00e9s G\u00f3mez","orcid":"https://orcid.org/0000-0003-3668-0653"},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andr\u00e9s G\u00f3mez","raw_affiliation_strings":["Department of Industrial Engineering, Swanson School of Engineering, University of Pittsburgh, Pittsburgh, PA, 15261-3077, USA","Department of Industrial Engineering, Swanson School of Engineering, University of Pittsburgh, Pittsburgh, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Swanson School of Engineering, University of Pittsburgh, Pittsburgh, PA, 15261-3077, USA","institution_ids":["https://openalex.org/I170201317"]},{"raw_affiliation_string":"Department of Industrial Engineering, Swanson School of Engineering, University of Pittsburgh, Pittsburgh, USA","institution_ids":["https://openalex.org/I170201317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008007328"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":{"value":2390,"currency":"EUR","value_usd":3090},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00611667,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":"2","first_page":"311","last_page":"340"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9994999766349792,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9919000267982483,"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.6633042097091675},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.5953496694564819},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5890387296676636},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.5846561193466187},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5518704652786255},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.5037190318107605},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4864608943462372},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4804617762565613},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4685778319835663},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4546246826648712},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.4277433454990387},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.42620334029197693},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.42207562923431396},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3930107355117798},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.3368225395679474},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.301827073097229},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.28751087188720703},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.15593299269676208},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14122554659843445}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.6633042097091675},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.5953496694564819},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5890387296676636},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.5846561193466187},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5518704652786255},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.5037190318107605},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4864608943462372},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4804617762565613},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4685778319835663},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4546246826648712},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.4277433454990387},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.42620334029197693},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.42207562923431396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3930107355117798},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3368225395679474},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.301827073097229},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.28751087188720703},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.15593299269676208},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14122554659843445},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s12532-018-0152-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12532-018-0152-7","pdf_url":null,"source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1706.05795","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1706.05795","pdf_url":"https://arxiv.org/pdf/1706.05795","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2632212210","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1706.05795.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1706.05795","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1706.05795","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1706.05795","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1706.05795","pdf_url":"https://arxiv.org/pdf/1706.05795","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W1508501959","https://openalex.org/W1541170979","https://openalex.org/W1568307856","https://openalex.org/W1632601927","https://openalex.org/W1963753244","https://openalex.org/W1971258090","https://openalex.org/W1978686733","https://openalex.org/W1987924891","https://openalex.org/W1995285162","https://openalex.org/W2004407575","https://openalex.org/W2009923109","https://openalex.org/W2011565421","https://openalex.org/W2014663083","https://openalex.org/W2021472931","https://openalex.org/W2027826061","https://openalex.org/W2037187765","https://openalex.org/W2060649248","https://openalex.org/W2062866389","https://openalex.org/W2063978378","https://openalex.org/W2076680677","https://openalex.org/W2077274614","https://openalex.org/W2089105401","https://openalex.org/W2105235982","https://openalex.org/W2109974898","https://openalex.org/W2122967662","https://openalex.org/W2133304166","https://openalex.org/W2135046866","https://openalex.org/W2143241251","https://openalex.org/W2146325267","https://openalex.org/W2166029977","https://openalex.org/W2167732364","https://openalex.org/W2493658341","https://openalex.org/W2611147814","https://openalex.org/W2616606677","https://openalex.org/W2796005925","https://openalex.org/W2963351303","https://openalex.org/W3100301673","https://openalex.org/W3121832289","https://openalex.org/W4236898819","https://openalex.org/W4251616545","https://openalex.org/W6838173123"],"related_works":["https://openalex.org/W2367160163","https://openalex.org/W2122992783","https://openalex.org/W2184047134","https://openalex.org/W16428385","https://openalex.org/W2170388968","https://openalex.org/W2265278902","https://openalex.org/W1532262662","https://openalex.org/W2086397439","https://openalex.org/W1994365609","https://openalex.org/W2990441249","https://openalex.org/W2767231366","https://openalex.org/W2558001808","https://openalex.org/W1783141495","https://openalex.org/W2070511462","https://openalex.org/W2093694358","https://openalex.org/W2736358712","https://openalex.org/W1578877637","https://openalex.org/W2181661122","https://openalex.org/W1987632745","https://openalex.org/W1513716913"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}