{"id":"https://openalex.org/W2142690901","doi":"https://doi.org/10.1007/s10589-006-8717-1","title":"Newton-KKT interior-point methods for indefinite quadratic programming","display_name":"Newton-KKT interior-point methods for indefinite quadratic programming","publication_year":2006,"publication_date":"2006-07-14","ids":{"openalex":"https://openalex.org/W2142690901","doi":"https://doi.org/10.1007/s10589-006-8717-1","mag":"2142690901"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-006-8717-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-006-8717-1","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","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/A5075495386","display_name":"Pierre-Antoine Absil","orcid":null},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"P.-A. Absil","raw_affiliation_strings":["D\u00e9partement d\u2019ing\u00e9nierie math\u00e9matique, Universit\u00e9 catholique de Louvain, 1348, Louvain-la-Neuve, Belgium","D\u00e9partement d'ing\u00e9nierie math\u00e9matique, Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium 1348#TAB#"],"affiliations":[{"raw_affiliation_string":"D\u00e9partement d\u2019ing\u00e9nierie math\u00e9matique, Universit\u00e9 catholique de Louvain, 1348, Louvain-la-Neuve, Belgium","institution_ids":["https://openalex.org/I95674353"]},{"raw_affiliation_string":"D\u00e9partement d'ing\u00e9nierie math\u00e9matique, Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium 1348#TAB#","institution_ids":["https://openalex.org/I95674353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033650937","display_name":"Andr\u00e9 L. Tits","orcid":"https://orcid.org/0000-0002-1542-7889"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andr\u00e9 L. Tits","raw_affiliation_strings":["Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD, 20742, USA","Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, USA 20742"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD, 20742, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, USA 20742","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075495386"],"corresponding_institution_ids":["https://openalex.org/I95674353"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":4.054,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.93668993,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"36","issue":"1","first_page":"5","last_page":"41"},"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.9973000288009644,"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.9951000213623047,"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/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.9817577600479126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7637231945991516},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.7396848797798157},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5822521448135376},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5717450976371765},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.49665528535842896},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.4561779201030731},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.45602792501449585},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.4409213066101074},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.43682661652565},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4139018654823303},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.4119829833507538},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.364820659160614},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34779709577560425},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.2473466396331787},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.19687095284461975},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17652711272239685},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.0955595076084137}],"concepts":[{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.9817577600479126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7637231945991516},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.7396848797798157},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5822521448135376},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5717450976371765},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.49665528535842896},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.4561779201030731},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.45602792501449585},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.4409213066101074},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.43682661652565},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4139018654823303},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.4119829833507538},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.364820659160614},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34779709577560425},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.2473466396331787},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.19687095284461975},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17652711272239685},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0955595076084137},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10589-006-8717-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-006-8717-1","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.76.6257","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.6257","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.isr.umd.edu/~andre/indefiniteQP.pdf","raw_type":"text"},{"id":"pmh:oai:dial.uclouvain.be:boreal:37601","is_oa":false,"landing_page_url":"http://hdl.handle.net/2078.1/37601","pdf_url":null,"source":{"id":"https://openalex.org/S4306400166","display_name":"Digital Access to Libraries","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800384882","host_organization_name":"Harris County Public Library","host_organization_lineage":["https://openalex.org/I2800384882"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computational Optimization and Applications : an international journal, Vol. 36, no. 1, p. 5-41 (2007)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W47264501","https://openalex.org/W147998453","https://openalex.org/W1486913552","https://openalex.org/W1508335918","https://openalex.org/W1522512418","https://openalex.org/W1533744522","https://openalex.org/W1588059640","https://openalex.org/W1595811582","https://openalex.org/W1967862529","https://openalex.org/W1978235473","https://openalex.org/W1978554456","https://openalex.org/W1978913642","https://openalex.org/W1981648990","https://openalex.org/W1982929029","https://openalex.org/W1988641273","https://openalex.org/W1992386684","https://openalex.org/W1994635453","https://openalex.org/W2009964554","https://openalex.org/W2010511518","https://openalex.org/W2014746566","https://openalex.org/W2018478336","https://openalex.org/W2041684917","https://openalex.org/W2063549526","https://openalex.org/W2063676335","https://openalex.org/W2067275683","https://openalex.org/W2069671092","https://openalex.org/W2072109526","https://openalex.org/W2082380592","https://openalex.org/W2083431695","https://openalex.org/W2130632243","https://openalex.org/W2168825111","https://openalex.org/W2209526309","https://openalex.org/W2251458176","https://openalex.org/W2270436539","https://openalex.org/W2281396299","https://openalex.org/W2326806701","https://openalex.org/W3029645440","https://openalex.org/W3140400264","https://openalex.org/W4230094279","https://openalex.org/W4293775970","https://openalex.org/W6605897853"],"related_works":["https://openalex.org/W4299713359","https://openalex.org/W4378551200","https://openalex.org/W2164754346","https://openalex.org/W2388495914","https://openalex.org/W2069426496","https://openalex.org/W2382819838","https://openalex.org/W2402755997","https://openalex.org/W2021667348","https://openalex.org/W2059043079","https://openalex.org/W2070265719"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}