{"id":"https://openalex.org/W2784529071","doi":"https://doi.org/10.1142/s0217595918500094","title":"An SQP-type Method with Superlinear Convergence for Nonlinear Semidefinite Programming","display_name":"An SQP-type Method with Superlinear Convergence for Nonlinear Semidefinite Programming","publication_year":2018,"publication_date":"2018-01-18","ids":{"openalex":"https://openalex.org/W2784529071","doi":"https://doi.org/10.1142/s0217595918500094","mag":"2784529071"},"language":"en","primary_location":{"id":"doi:10.1142/s0217595918500094","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0217595918500094","pdf_url":null,"source":{"id":"https://openalex.org/S1254427","display_name":"Asia Pacific Journal of Operational Research","issn_l":"0217-5959","issn":["0217-5959","1793-7019"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Asia-Pacific Journal of Operational Research","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/A5060447965","display_name":"Qi Zhao","orcid":"https://orcid.org/0000-0003-4800-1136"},"institutions":[{"id":"https://openalex.org/I3923682","display_name":"Soochow University","ror":"https://ror.org/05t8y2r12","country_code":"CN","type":"education","lineage":["https://openalex.org/I3923682"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qi Zhao","raw_affiliation_strings":["School of Mathematical Science, Soochow University, Suzhou 215006, P. R. China"],"affiliations":[{"raw_affiliation_string":"School of Mathematical Science, Soochow University, Suzhou 215006, P. R. China","institution_ids":["https://openalex.org/I3923682"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029421861","display_name":"Zhongwen Chen","orcid":"https://orcid.org/0000-0001-5218-0152"},"institutions":[{"id":"https://openalex.org/I3923682","display_name":"Soochow University","ror":"https://ror.org/05t8y2r12","country_code":"CN","type":"education","lineage":["https://openalex.org/I3923682"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhongwen Chen","raw_affiliation_strings":["School of Mathematical Science, Soochow University, Suzhou 215006, P. R. China"],"affiliations":[{"raw_affiliation_string":"School of Mathematical Science, Soochow University, Suzhou 215006, P. R. China","institution_ids":["https://openalex.org/I3923682"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029421861"],"corresponding_institution_ids":["https://openalex.org/I3923682"],"apc_list":null,"apc_paid":null,"fwci":1.0248,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.71940437,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"35","issue":"03","first_page":"1850009","last_page":"1850009"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9994999766349792,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9980999827384949,"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/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.8531664609909058},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.7120921611785889},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6726410388946533},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.6574028730392456},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.6548744440078735},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6232725381851196},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5449567437171936},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5233380198478699},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5074488520622253},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.4875490069389343},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.4648284912109375},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.45288562774658203},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.37743738293647766},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23192039132118225},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.09155207872390747}],"concepts":[{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.8531664609909058},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7120921611785889},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6726410388946533},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.6574028730392456},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.6548744440078735},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6232725381851196},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5449567437171936},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5233380198478699},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5074488520622253},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.4875490069389343},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.4648284912109375},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.45288562774658203},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.37743738293647766},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23192039132118225},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.09155207872390747},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0217595918500094","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0217595918500094","pdf_url":null,"source":{"id":"https://openalex.org/S1254427","display_name":"Asia Pacific Journal of Operational Research","issn_l":"0217-5959","issn":["0217-5959","1793-7019"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Asia-Pacific Journal of Operational Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:wsi:apjorx:v:35:y:2018:i:03:n:s0217595918500094","is_oa":false,"landing_page_url":"http://www.worldscientific.com/doi/abs/10.1142/S0217595918500094","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W119682313","https://openalex.org/W1568307856","https://openalex.org/W1601741115","https://openalex.org/W1826840950","https://openalex.org/W1986468691","https://openalex.org/W2013621063","https://openalex.org/W2024318675","https://openalex.org/W2038555278","https://openalex.org/W2068083893","https://openalex.org/W2076161359","https://openalex.org/W2089856363","https://openalex.org/W2090839010","https://openalex.org/W2092473536","https://openalex.org/W2101926728","https://openalex.org/W2117110228","https://openalex.org/W2132385139","https://openalex.org/W2153271882","https://openalex.org/W2158604542","https://openalex.org/W2161496432","https://openalex.org/W3206321659","https://openalex.org/W4234068421"],"related_works":["https://openalex.org/W2364528045","https://openalex.org/W2348903644","https://openalex.org/W2351113357","https://openalex.org/W1653317167","https://openalex.org/W2737505353","https://openalex.org/W2370797736","https://openalex.org/W2385886188","https://openalex.org/W2369616053","https://openalex.org/W2366269287","https://openalex.org/W3154036230"],"abstract_inverted_index":{"A":[0],"sequentially":[1,17],"semidefinite":[2,10,32],"programming":[3,11,19,33],"method":[4],"is":[5,69],"proposed":[6,67],"for":[7],"solving":[8,29],"nonlinear":[9],"problem":[12],"(NLSDP).":[13],"Inspired":[14],"by":[15,28],"the":[16,22,55,66,76,86,93,102,106,111,122,125],"quadratic":[18,31],"(SQP)":[20],"method,":[21],"algorithm":[23,68,84],"generates":[24],"a":[25,30,46,81],"search":[26,48],"direction":[27],"subproblem":[34],"at":[35],"each":[36],"iteration.":[37],"The":[38],"[Formula:":[39],"see":[40],"text]":[41],"exact":[42],"penalty":[43],"function":[44],"and":[45,90,105],"line":[47],"strategy":[49],"are":[50,118],"used":[51],"to":[52,74,120],"determine":[53],"whether":[54],"trial":[56],"step":[57,89],"can":[58,98],"be":[59,99],"accepted":[60],"or":[61],"not.":[62],"Under":[63],"mild":[64],"assumptions,":[65],"globally":[70],"convergent.":[71],"In":[72],"order":[73],"avoid":[75],"Maratos":[77],"effect,":[78],"we":[79],"present":[80],"modified":[82],"SQP-type":[83],"with":[85,110],"second-order":[87,107],"correction":[88],"prove":[91],"that":[92],"fast":[94],"local":[95],"superlinear":[96],"convergence":[97],"obtained":[100],"under":[101],"strict":[103],"complementarity":[104],"sufficient":[108],"condition":[109],"sigma":[112],"term.":[113],"Finally,":[114],"some":[115],"numerical":[116],"experiments":[117],"given":[119],"show":[121],"effectiveness":[123],"of":[124],"algorithm.":[126]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2025-10-10T00:00:00"}