{"id":"https://openalex.org/W2291047496","doi":"https://doi.org/10.1109/acssc.2015.7421157","title":"Max-min feasible point pursuit for non-convex QCQP","display_name":"Max-min feasible point pursuit for non-convex QCQP","publication_year":2015,"publication_date":"2015-11-01","ids":{"openalex":"https://openalex.org/W2291047496","doi":"https://doi.org/10.1109/acssc.2015.7421157","mag":"2291047496"},"language":"en","primary_location":{"id":"doi:10.1109/acssc.2015.7421157","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acssc.2015.7421157","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 49th Asilomar Conference on Signals, Systems and Computers","raw_type":"proceedings-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/A5034936665","display_name":"Charilaos I. Kanatsoulis","orcid":"https://orcid.org/0000-0002-0952-1561"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Charilaos I. Kanatsoulis","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050186120","display_name":"Nicholas D. Sidiropoulos","orcid":"https://orcid.org/0000-0002-3385-7911"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nicholas D. Sidiropoulos","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":0.6701,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72069548,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"31","issue":null,"first_page":"401","last_page":"405"},"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.9998000264167786,"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.9998000264167786,"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.996399998664856,"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/T10851","display_name":"Optical Wireless Communication Technologies","score":0.9886000156402588,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6607309579849243},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.618169903755188},{"id":"https://openalex.org/keywords/quadratic-growth","display_name":"Quadratic growth","score":0.5939451456069946},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5810286998748779},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5352685451507568},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.5208597779273987},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.49848222732543945},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4952496588230133},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4925709366798401},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4827843904495239},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.44863361120224},{"id":"https://openalex.org/keywords/toolbox","display_name":"Toolbox","score":0.4338530898094177},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.42652595043182373},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4194507896900177},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4167838990688324},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2734794318675995}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6607309579849243},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.618169903755188},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.5939451456069946},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5810286998748779},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5352685451507568},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.5208597779273987},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.49848222732543945},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4952496588230133},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4925709366798401},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4827843904495239},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.44863361120224},{"id":"https://openalex.org/C2777655017","wikidata":"https://www.wikidata.org/wiki/Q1501161","display_name":"Toolbox","level":2,"score":0.4338530898094177},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.42652595043182373},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4194507896900177},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4167838990688324},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2734794318675995},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/acssc.2015.7421157","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acssc.2015.7421157","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 49th Asilomar Conference on Signals, Systems and Computers","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.6200000047683716}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1571070457","https://openalex.org/W1829525054","https://openalex.org/W1967073510","https://openalex.org/W1969648546","https://openalex.org/W1981044874","https://openalex.org/W1986634396","https://openalex.org/W1991264581","https://openalex.org/W1996215314","https://openalex.org/W2005102197","https://openalex.org/W2022026988","https://openalex.org/W2031643974","https://openalex.org/W2050622933","https://openalex.org/W2074859470","https://openalex.org/W2093229781","https://openalex.org/W2100573451","https://openalex.org/W2122744491","https://openalex.org/W2128757878","https://openalex.org/W2159081591","https://openalex.org/W2248483376","https://openalex.org/W2536620281","https://openalex.org/W2912522929","https://openalex.org/W3100992968","https://openalex.org/W4250589301","https://openalex.org/W6638655679"],"related_works":["https://openalex.org/W2897697015","https://openalex.org/W3035921962","https://openalex.org/W2169350232","https://openalex.org/W2004392729","https://openalex.org/W2233303476","https://openalex.org/W2097504558","https://openalex.org/W2037790839","https://openalex.org/W2083575507","https://openalex.org/W2461836650","https://openalex.org/W2121045497"],"abstract_inverted_index":{"Quadratically":[0],"constrained":[1],"quadratic":[2],"programming":[3],"(QCQP)":[4],"has":[5],"a":[6,60,88,115,126,146],"variety":[7],"of":[8,84,118],"applications":[9],"in":[10,18,103,125],"signal":[11],"processing,":[12],"communications,":[13],"and":[14,26,48,87,97,120],"networking":[15],"-":[16],"but":[17,55],"many":[19],"cases":[20],"the":[21,122,134,138],"associated":[22],"QCQP":[23,152],"is":[24],"non-convex":[25,53,151],"NP-hard.":[27],"In":[28,107],"such":[29],"cases,":[30],"semidefinite":[31],"relaxation":[32],"(SDR)":[33],"followed":[34],"by":[35],"randomization,":[36],"or":[37,67],"successive":[38],"convex":[39],"approximation":[40],"(SCA)":[41],"are":[42,65],"typically":[43,56],"used":[44],"for":[45],"approximation.":[46],"SDR":[47],"SCA":[49,80,113],"work":[50],"with":[51,81,100],"one-sided":[52],"constraints,":[54],"fail":[57],"to":[58,94,149],"produce":[59],"feasible":[61,73,96],"point":[62,74,117],"when":[63],"there":[64],"two-sided":[66],"more":[68,128],"generally":[69],"indefinite":[70],"constraints.":[71],"A":[72],"pursuit":[75],"(FPP-SCA)":[76],"algorithm":[77],"that":[78,133],"combines":[79],"judicious":[82],"use":[83],"slack":[85],"variables":[86],"penalty":[89],"term":[90],"was":[91],"recently":[92],"proposed":[93],"obtain":[95],"near-optimal":[98],"solutions":[99],"high":[101],"probability":[102],"these":[104],"difficult":[105],"cases.":[106],"this":[108],"contribution,":[109],"we":[110],"revisit":[111],"FPP-":[112],"from":[114],"different":[116],"view":[119],"recast":[121],"feasibility":[123],"problem":[124],"simpler,":[127],"compact":[129],"way.":[130],"Simulations":[131],"show":[132],"new":[135],"approach":[136],"outperforms":[137],"original":[139],"FPP-SCA":[140],"under":[141],"certain":[142],"conditions,":[143],"thus":[144],"providing":[145],"useful":[147],"addition":[148],"our":[150],"toolbox.":[153]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}