{"id":"https://openalex.org/W2060676537","doi":"https://doi.org/10.1007/bf01582218","title":"Optimal objective function approximation for separable convex quadratic programming","display_name":"Optimal objective function approximation for separable convex quadratic programming","publication_year":1994,"publication_date":"1994-10-01","ids":{"openalex":"https://openalex.org/W2060676537","doi":"https://doi.org/10.1007/bf01582218","mag":"2060676537"},"language":"en","primary_location":{"id":"doi:10.1007/bf01582218","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01582218","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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","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/A5004593449","display_name":"Faruk G\u00fcder","orcid":null},"institutions":[{"id":"https://openalex.org/I1925986","display_name":"Loyola University Chicago","ror":"https://ror.org/04b6x2g63","country_code":"US","type":"education","lineage":["https://openalex.org/I1925986"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"F. G\u00fcder","raw_affiliation_strings":["School of Business, Loyola University Chicago, 60611, Chicago, Illinois, USA","School of Business, Loyola University Chicago, Chicago, USA 60611#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Business, Loyola University Chicago, 60611, Chicago, Illinois, USA","institution_ids":["https://openalex.org/I1925986"]},{"raw_affiliation_string":"School of Business, Loyola University Chicago, Chicago, USA 60611#TAB#","institution_ids":["https://openalex.org/I1925986"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022077992","display_name":"James Morris","orcid":"https://orcid.org/0000-0003-3934-0937"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. G. Morris","raw_affiliation_strings":["School of Business, University of Wisconsin-Madison, 53706, Madison, Wisconsin, USA","School of Business, University of Wisconsin-Madison, Madison, USA 53706#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Business, University of Wisconsin-Madison, 53706, Madison, Wisconsin, USA","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"School of Business, University of Wisconsin-Madison, Madison, USA 53706#TAB#","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004593449"],"corresponding_institution_ids":["https://openalex.org/I1925986"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.5453,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.66905444,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"67","issue":"1-3","first_page":"133","last_page":"142"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9993000030517578,"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.9993000030517578,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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/T10545","display_name":"Optimization and Variational Analysis","score":0.996999979019165,"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.7974711656570435},{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.672006368637085},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.6549652218818665},{"id":"https://openalex.org/keywords/piecewise-linear-function","display_name":"Piecewise linear function","score":0.5594816207885742},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5553078055381775},{"id":"https://openalex.org/keywords/minimax-approximation-algorithm","display_name":"Minimax approximation algorithm","score":0.5077396631240845},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5040447115898132},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.48318424820899963},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.4818519353866577},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4791528582572937},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4645151197910309},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4599408805370331},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.45920780301094055},{"id":"https://openalex.org/keywords/linear-approximation","display_name":"Linear approximation","score":0.4525243639945984},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.42992740869522095},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.420803427696228},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.2999860346317291},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.10521024465560913}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7974711656570435},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.672006368637085},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.6549652218818665},{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.5594816207885742},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5553078055381775},{"id":"https://openalex.org/C117148685","wikidata":"https://www.wikidata.org/wiki/Q6865376","display_name":"Minimax approximation algorithm","level":2,"score":0.5077396631240845},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5040447115898132},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.48318424820899963},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.4818519353866577},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4791528582572937},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4645151197910309},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4599408805370331},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.45920780301094055},{"id":"https://openalex.org/C160824197","wikidata":"https://www.wikidata.org/wiki/Q2071054","display_name":"Linear approximation","level":3,"score":0.4525243639945984},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.42992740869522095},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.420803427696228},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.2999860346317291},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.10521024465560913},{"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/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},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01582218","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01582218","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W45658736","https://openalex.org/W566325299","https://openalex.org/W1837934624","https://openalex.org/W1972615387","https://openalex.org/W1977187942","https://openalex.org/W1992720281","https://openalex.org/W1999965122","https://openalex.org/W2008308506","https://openalex.org/W2015142254","https://openalex.org/W2015292624","https://openalex.org/W2034306657","https://openalex.org/W2040192492","https://openalex.org/W2041463837","https://openalex.org/W2064873618","https://openalex.org/W2095033782","https://openalex.org/W2107202075","https://openalex.org/W2127334769","https://openalex.org/W2132347401","https://openalex.org/W2137436165","https://openalex.org/W2155370486","https://openalex.org/W2156060532","https://openalex.org/W2321656971","https://openalex.org/W2344585715","https://openalex.org/W2787523326","https://openalex.org/W4239681903","https://openalex.org/W4301457986"],"related_works":["https://openalex.org/W2131136359","https://openalex.org/W2087686193","https://openalex.org/W1968186255","https://openalex.org/W2389806241","https://openalex.org/W2007611377","https://openalex.org/W2167394514","https://openalex.org/W2100541988","https://openalex.org/W2070687798","https://openalex.org/W2117536981","https://openalex.org/W3200744632"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}