{"id":"https://openalex.org/W2033880613","doi":"https://doi.org/10.1080/10556780500140102","title":"Sparsity in convex quadratic programming with interior point methods","display_name":"Sparsity in convex quadratic programming with interior point methods","publication_year":2006,"publication_date":"2006-06-27","ids":{"openalex":"https://openalex.org/W2033880613","doi":"https://doi.org/10.1080/10556780500140102","mag":"2033880613"},"language":"en","primary_location":{"id":"doi:10.1080/10556780500140102","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500140102","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"],"host_organization_lineage_names":["Taylor & Francis"],"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/A5042817676","display_name":"Csaba M\u00e9sz\u00e1ros","orcid":"https://orcid.org/0000-0003-0306-8417"},"institutions":[{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"government","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Csaba M\u00e9sz\u00e1ros","raw_affiliation_strings":["Laboratory of Operations Research and Decision Systems, Hungarian Academy of Sciences, P.O. Box 63, H-1518, Budapest, Hungary","Laboratory of Operations Research and Decision Systems, Hungarian Academy of Sciences , P.O. Box 63, H-1518, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory of Operations Research and Decision Systems, Hungarian Academy of Sciences, P.O. Box 63, H-1518, Budapest, Hungary","institution_ids":["https://openalex.org/I7597260"]},{"raw_affiliation_string":"Laboratory of Operations Research and Decision Systems, Hungarian Academy of Sciences , P.O. Box 63, H-1518, Budapest, Hungary","institution_ids":["https://openalex.org/I7597260"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5042817676"],"corresponding_institution_ids":["https://openalex.org/I7597260"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.11550152,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"21","issue":"5","first_page":"733","last_page":"745"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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.9854999780654907,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9847000241279602,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.7687357664108276},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.6703547835350037},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.6611261963844299},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6524662971496582},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.6006894111633301},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5648051500320435},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5495395660400391},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48853883147239685},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.485710471868515},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4672175645828247},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.4529414176940918},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.44129371643066406},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43537068367004395},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.42694562673568726},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3653520941734314}],"concepts":[{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.7687357664108276},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.6703547835350037},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.6611261963844299},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6524662971496582},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.6006894111633301},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5648051500320435},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5495395660400391},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48853883147239685},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.485710471868515},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4672175645828247},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.4529414176940918},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.44129371643066406},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43537068367004395},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.42694562673568726},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3653520941734314},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10556780500140102","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500140102","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"],"host_organization_lineage_names":["Taylor & Francis"],"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"},{"id":"pmh:oai:eprints.sztaki.hu:4433","is_oa":false,"landing_page_url":"http://eprints.sztaki.hu/4433/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401907","display_name":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I7597260","host_organization_name":"Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I7597260"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"ISI Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321994","display_name":"Hungarian Scientific Research Fund","ror":"https://ror.org/00v349e63"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W40680864","https://openalex.org/W1493426390","https://openalex.org/W1514645957","https://openalex.org/W1518039036","https://openalex.org/W1969321535","https://openalex.org/W1985564371","https://openalex.org/W2007161401","https://openalex.org/W2009629085","https://openalex.org/W2028570814","https://openalex.org/W2043118877","https://openalex.org/W2052602889","https://openalex.org/W2055563837","https://openalex.org/W2074043275","https://openalex.org/W2075998338","https://openalex.org/W2079687415","https://openalex.org/W2092163279","https://openalex.org/W2093903024","https://openalex.org/W2118382442","https://openalex.org/W2204863336","https://openalex.org/W4231913195","https://openalex.org/W4244832091"],"related_works":["https://openalex.org/W2357193936","https://openalex.org/W2364127131","https://openalex.org/W1985181089","https://openalex.org/W4389749172","https://openalex.org/W2388495914","https://openalex.org/W2382819838","https://openalex.org/W2021667348","https://openalex.org/W2069426496","https://openalex.org/W2410228078","https://openalex.org/W2070265719"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"investigate":[4],"how":[5,73],"the":[6,27,33,43,53,74,102,115],"sparsity":[7,54,89],"of":[8,21,30,56,62,77,114],"non-separable":[9,44,57,78,130],"quadratic":[10],"programming":[11,64,107],"(QP)":[12],"problems":[13,59,80],"behaves":[14],"in":[15],"interior":[16],"point":[17],"methods.":[18],"The":[19],"target":[20],"our":[22],"investigation":[23],"is":[24,120],"to":[25,60,93],"compare":[26],"separable":[28],"equivalent":[29],"QPs":[31],"with":[32],"normal":[34],"equation":[35],"(NOR)":[36],"and":[37,117],"augmented":[38],"system":[39],"(AUG)":[40],"approach":[41],"on":[42,127],"form.":[45],"We":[46,71,99],"show":[47,100],"that":[48,61,101],"one":[49],"can":[50,81,91,108],"easily":[51],"attribute":[52],"issues":[55],"QP":[58,79,132],"linear":[63,106],"for":[65,105,111],"which":[66,113],"well-developed":[67],"techniques":[68],"are":[69,125],"available.":[70],"describe":[72],"structural":[75],"properties":[76],"be":[82,109],"represented":[83],"by":[84],"a":[85,95],"single":[86],"matrix":[87],"whose":[88],"pattern":[90],"serve":[92],"determine":[94],"fill-reducing":[96],"row":[97],"permutation.":[98],"heuristics":[103],"developed":[104],"used":[110],"determining":[112],"AUG":[116],"NOR":[118],"approaches":[119],"more":[121],"advantageous.":[122],"Numerical":[123],"results":[124],"given":[126],"publicly":[128],"available":[129],"convex":[131],"problems.":[133]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}