{"id":"https://openalex.org/W2103138013","doi":"https://doi.org/10.4304/jcp.8.6.1496-1503","title":"Improved Feasible SQP Algorithm for Nonlinear Programs with Equality Constrained Sub-Problems","display_name":"Improved Feasible SQP Algorithm for Nonlinear Programs with Equality Constrained Sub-Problems","publication_year":2013,"publication_date":"2013-05-17","ids":{"openalex":"https://openalex.org/W2103138013","doi":"https://doi.org/10.4304/jcp.8.6.1496-1503","mag":"2103138013"},"language":"en","primary_location":{"id":"doi:10.4304/jcp.8.6.1496-1503","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.8.6.1496-1503","pdf_url":null,"source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","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/A5007896747","display_name":"Zhijun Luo","orcid":"https://orcid.org/0000-0001-8966-9314"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhijun Luo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062788550","display_name":"Guohua Chen","orcid":"https://orcid.org/0000-0001-8011-6254"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guohua Chen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027361940","display_name":"Simei Luo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Simei Luo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5065131815","display_name":"Zhibin Zhu","orcid":"https://orcid.org/0000-0002-9929-8163"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhibin Zhu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9264,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.7507181,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"8","issue":"6","first_page":null,"last_page":null},"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.9975000023841858,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.983299970626831,"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/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.9329026341438293},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.5771299600601196},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5758841037750244},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5440762042999268},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.463010311126709},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.452696830034256},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32436394691467285},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.1872614026069641}],"concepts":[{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.9329026341438293},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.5771299600601196},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5758841037750244},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5440762042999268},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.463010311126709},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.452696830034256},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32436394691467285},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.1872614026069641},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4304/jcp.8.6.1496-1503","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.8.6.1496-1503","pdf_url":null,"source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.6100000143051147,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W35651078","https://openalex.org/W1748199557","https://openalex.org/W1899476613","https://openalex.org/W1989921393","https://openalex.org/W2006449495","https://openalex.org/W2013261078","https://openalex.org/W2013315229","https://openalex.org/W2023346104","https://openalex.org/W2026354545","https://openalex.org/W2031856370","https://openalex.org/W2057875970","https://openalex.org/W2081363649","https://openalex.org/W2093843734","https://openalex.org/W2106813160","https://openalex.org/W2152467249","https://openalex.org/W2156762405","https://openalex.org/W2313802579","https://openalex.org/W2316443268","https://openalex.org/W2352006333","https://openalex.org/W4240022917"],"related_works":["https://openalex.org/W1495847109","https://openalex.org/W2355690024","https://openalex.org/W2084387308","https://openalex.org/W2610571865","https://openalex.org/W1555927645","https://openalex.org/W2081101031","https://openalex.org/W2073171678","https://openalex.org/W436931041","https://openalex.org/W2092346180","https://openalex.org/W1548320777"],"abstract_inverted_index":{"This":[0],"paper":[1,46,104],"is":[2,47,67,84,92,105],"concerned":[3],"with":[4,18,29],"an":[5,52],"improved":[6],"feasible":[7,40],"sequential":[8],"quadratic":[9,55],"programming":[10,56],"(FSQP)":[11],"method":[12,43],"for":[13],"nonlinear":[14],"programs.":[15],"As":[16],"compared":[17],"the":[19,26,39,42,59,82,100],"existing":[20],"SQP":[21],"methods":[22],"which":[23,72],"required":[24],"solving":[25],"QP":[27],"sub-problem":[28],"inequality":[30],"constraints":[31],"in":[32,35,102],"single":[33],"iteration,":[34],"order":[36],"to":[37,50],"obtain":[38],"direction,":[41],"of":[44,90],"this":[45,103],"only":[48],"necessary":[49],"solve":[51],"equality":[53],"constrained":[54],"sub-problems.":[57],"Combined":[58],"generalized":[60],"projection":[61],"technique,":[62],"a":[63],"height-order":[64],"correction":[65],"direction":[66],"yielded":[68],"by":[69],"explicit":[70],"formulas,":[71],"can":[73],"avoids":[74],"Maratos":[75],"effect.":[76],"Furthermore,":[77],"under":[78],"some":[79],"mild":[80],"assumptions,":[81],"algorithm":[83,101],"globally":[85],"convergent":[86],"and":[87],"its":[88],"rate":[89],"convergence":[91],"one-step":[93],"superlinearly.":[94],"Numerical":[95],"results":[96],"reported":[97],"show":[98],"that":[99],"effective.":[106]},"counts_by_year":[{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}