{"id":"https://openalex.org/W1994469568","doi":"https://doi.org/10.1007/s101070050116","title":"Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods","display_name":"Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods","publication_year":2000,"publication_date":"2000-04-01","ids":{"openalex":"https://openalex.org/W1994469568","doi":"https://doi.org/10.1007/s101070050116","mag":"1994469568"},"language":"en","primary_location":{"id":"doi:10.1007/s101070050116","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s101070050116","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5007272964","display_name":"David F. Shanno","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"David F. Shanno","raw_affiliation_strings":["Rutgers University, New Brunswick, NJ, USA, , , , , , US","Rutgers University, New Brunswick, NJ, USA, , US"],"affiliations":[{"raw_affiliation_string":"Rutgers University, New Brunswick, NJ, USA, , , , , , US","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Rutgers University, New Brunswick, NJ, USA, , US","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083969173","display_name":"Robert J. Vanderbei","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert J. Vanderbei","raw_affiliation_strings":["Princeton University, Princeton, NJ, USA, , , , , , US","Princeton University, Princeton, NJ, USA, US"],"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ, USA, , , , , , US","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University, Princeton, NJ, USA, US","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007272964"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":7.8658,"has_fulltext":false,"cited_by_count":108,"citation_normalized_percentile":{"value":0.98096264,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"87","issue":"2","first_page":"303","last_page":"316"},"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9945999979972839,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9902999997138977,"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/hessian-matrix","display_name":"Hessian matrix","score":0.8626676797866821},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.8082547187805176},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7679409980773926},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.6882656812667847},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5656455755233765},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5282976627349854},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5158535838127136},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4987776279449463},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.48560968041419983},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.47465449571609497},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.44015058875083923},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.43782421946525574},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.43103963136672974},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4272879660129547},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.4251518249511719},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4242936372756958},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.403360515832901},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3057238757610321},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08442902565002441}],"concepts":[{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.8626676797866821},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.8082547187805176},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7679409980773926},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.6882656812667847},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5656455755233765},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5282976627349854},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5158535838127136},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4987776279449463},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.48560968041419983},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.47465449571609497},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.44015058875083923},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.43782421946525574},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.43103963136672974},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4272879660129547},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.4251518249511719},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4242936372756958},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.403360515832901},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3057238757610321},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08442902565002441},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s101070050116","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s101070050116","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.46000000834465027,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1508335918","https://openalex.org/W1748199557","https://openalex.org/W1964166152","https://openalex.org/W1968553199","https://openalex.org/W1981053712","https://openalex.org/W2059102393","https://openalex.org/W2069426496","https://openalex.org/W2083431695","https://openalex.org/W2085548605","https://openalex.org/W2086867325"],"related_works":["https://openalex.org/W2388495914","https://openalex.org/W4389749172","https://openalex.org/W2069426496","https://openalex.org/W2059909660","https://openalex.org/W2382819838","https://openalex.org/W4210895176","https://openalex.org/W2402755997","https://openalex.org/W366623699","https://openalex.org/W2021667348","https://openalex.org/W2410228078"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":5}],"updated_date":"2026-03-21T08:13:44.787528","created_date":"2025-10-10T00:00:00"}