{"id":"https://openalex.org/W278523381","doi":null,"title":"A Sequential Quadratic Programming Algorithm for Solving Large, Sparse Nonlinear Programs.","display_name":"A Sequential Quadratic Programming Algorithm for Solving Large, Sparse Nonlinear Programs.","publication_year":1984,"publication_date":"1984-05-01","ids":{"openalex":"https://openalex.org/W278523381","mag":"278523381"},"language":"en","primary_location":{"id":"pmh:ADA145854","doi":null,"is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA145854","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5086600474","display_name":"Ronald H. Nickel","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ronald H. Nickel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5054755159","display_name":"Jon W. Tolle","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jon W. Tolle","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":1.0253,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.66565962,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":null,"issue":null,"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.9990000128746033,"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.9990000128746033,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.00039999998989515007,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.00019999999494757503,"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":1.0},{"id":"https://openalex.org/keywords/large-scale-optimization","display_name":"large-scale optimization","score":0.824999988079071},{"id":"https://openalex.org/keywords/cholesky-decomposition","display_name":"Cholesky decomposition","score":0.7440000176429749},{"id":"https://openalex.org/keywords/active-constraints","display_name":"active constraints","score":0.5220000147819519},{"id":"https://openalex.org/keywords/nonlinear-constraints","display_name":"nonlinear constraints","score":0.5720000267028809}],"concepts":[{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.7560635805130005},{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.7539125680923462},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.659294605255127},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5521357655525208},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5520395636558533},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5228772163391113},{"id":"https://openalex.org/C34727166","wikidata":"https://www.wikidata.org/wiki/Q515375","display_name":"Cholesky decomposition","level":3,"score":0.5206927061080933},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4888014495372772},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.4267002046108246},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4256399869918823},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42456668615341187},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.41044145822525024},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.1473374366760254},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:ADA145854","doi":null,"is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA145854","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"},{"id":"mag:278523381","doi":null,"is_oa":false,"landing_page_url":"https://apps.dtic.mil/dtic/tr/fulltext/u2/a145854.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2042189283","https://openalex.org/W1980384412","https://openalex.org/W4237883685","https://openalex.org/W1496203103","https://openalex.org/W2089903473","https://openalex.org/W2084387308","https://openalex.org/W2087189951","https://openalex.org/W2098918699","https://openalex.org/W2327930114","https://openalex.org/W1971536112"],"abstract_inverted_index":{"This":[0],"document":[1],"describes":[2],"the":[3,23,30,52,56,59,72,83,101,103,112,146,152,155],"structure":[4],"and":[5,61],"theory":[6],"for":[7,13,168],"a":[8,26,48,66,88],"sequential":[9,42],"quadratic":[10,43,73,85,114],"programming":[11,44],"algorithm":[12,37,153,164],"solving":[14,82,169],"large,":[15,159],"sparse":[16,49,67,160],"nonlinear":[17,161,172],"optimization":[18],"problems.":[19],"Also":[20],"provided":[21],"are":[22,97],"details":[24],"of":[25,29,55,58],"computer":[27],"implementation":[28],"algorithm,":[31],"along":[32],"with":[33,145],"test":[34,133],"results.":[35],"The":[36,69,163],"is":[38,79,125,165],"based":[39],"on":[40],"Han's":[41],"method.":[45],"It":[46],"maintains":[47],"approximation":[50],"to":[51,71,120,140,157],"Cholesky":[53],"factor":[54],"Hessian":[57],"Lagrangian":[60],"stores":[62],"all":[63],"gradients":[64],"in":[65,99,136],"format.":[68],"solution":[70],"program":[74,86,115],"generated":[75],"at":[76],"each":[77],"step":[78],"obtained":[80],"by":[81],"dual":[84,104],"using":[87],"projected":[89],"conjugate":[90],"gradient":[91],"algorithm.":[92,147],"Sine":[93],"only":[94],"active":[95],"constraints":[96],"considered":[98],"forming":[100],"dual,":[102],"problem":[105],"will":[106],"normally":[107],"be":[108],"much":[109,118],"smaller":[110],"than":[111],"primal":[113],"and,":[116],"hence,":[117],"easier":[119],"solve.":[121],"An":[122],"updating":[123],"procedure":[124],"employed":[126],"that":[127,151],"does":[128],"not":[129],"destroy":[130],"sparsity.":[131],"Several":[132],"problems,":[134],"ranging":[135],"size":[137],"from":[138],"5":[139],"60":[141],"variables":[142],"were":[143],"solved":[144],"These":[148],"results":[149],"indicate":[150],"has":[154],"potential":[156],"solve":[158],"programs.":[162],"especially":[166],"attractive":[167],"problems":[170],"having":[171],"constraints.":[173],"(Author)":[174]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}