{"id":"https://openalex.org/W2136293333","doi":"https://doi.org/10.12816/0006136","title":"A Weighted Target- following Algorithm for Linearly Constrained Convex Optimization","display_name":"A Weighted Target- following Algorithm for Linearly Constrained Convex Optimization","alternate_titles":[],"publication_year":2012,"publication_date":"2012-12-01","ids":{"openalex":"https://openalex.org/W2136293333","doi":"https://doi.org/10.12816/0006136","mag":"2136293333"},"language":"en","primary_location":{"id":"doi:10.12816/0006136","doi":"https://doi.org/10.12816/0006136","is_oa":false,"landing_page_url":"https://doi.org/10.12816/0006136","pdf_url":null,"source":{"id":"https://openalex.org/S2764733010","display_name":"International Journal of Open Problems in Computer Science and Mathematics","issn_l":"1998-6262","issn":["1998-6262","2079-0376"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4324277456","host_organization_name":"TechKnowledge General Trading","host_organization_lineage":["https://openalex.org/P4324277456"],"host_organization_lineage_names":["TechKnowledge General Trading"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Open Problems in Computer Science and Mathematics","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2136293333"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5005743233","display_name":"Hayet Roumili","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Hayet Roumili","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5035847619","display_name":"Zakia Kebbiche","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Zakia Kebbiche","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.0,"has_fulltext":false,"cited_by_count":1,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":92},"biblio":{"volume":"5","issue":"4","first_page":"25","last_page":"33"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9984999895095825,"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.9984999895095825,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.0003000000142492354,"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/linearly-constrained-convex-optimization","display_name":"linearly constrained convex optimization","score":0.9440000057220459},{"id":"https://openalex.org/keywords/convex-quadratic-programming","display_name":"convex quadratic programming","score":0.9269999861717224},{"id":"https://openalex.org/keywords/search-direction","display_name":"search direction","score":0.8339999914169312},{"id":"https://openalex.org/keywords/central-path","display_name":"central path","score":0.9300000071525574},{"id":"https://openalex.org/keywords/initialization-problem","display_name":"initialization problem","score":0.546999990940094},{"id":"https://openalex.org/keywords/polynomial-time-complexity","display_name":"polynomial complexity","score":0.796999990940094},{"id":"https://openalex.org/keywords/interior-point-methods","display_name":"interior point methods","score":0.7900000214576721}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7842940092086792},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6938916444778442},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.6924456357955933},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.6238261461257935},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5627817511558533},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5226754546165466},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4901948571205139},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4836629331111908},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4648526906967163},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4540000259876251},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37612777948379517},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13693353533744812},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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":1,"locations":[{"id":"doi:10.12816/0006136","doi":"https://doi.org/10.12816/0006136","is_oa":false,"landing_page_url":"https://doi.org/10.12816/0006136","pdf_url":null,"source":{"id":"https://openalex.org/S2764733010","display_name":"International Journal of Open Problems in Computer Science and Mathematics","issn_l":"1998-6262","issn":["1998-6262","2079-0376"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4324277456","host_organization_name":"TechKnowledge General Trading","host_organization_lineage":["https://openalex.org/P4324277456"],"host_organization_lineage_names":["TechKnowledge General Trading"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Open Problems in Computer Science and Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1985564371","https://openalex.org/W2025473301","https://openalex.org/W2068674826","https://openalex.org/W2130336971","https://openalex.org/W2141176865","https://openalex.org/W2157590940","https://openalex.org/W2162465786","https://openalex.org/W2611147814"],"related_works":["https://openalex.org/W1975279600","https://openalex.org/W1552959538","https://openalex.org/W4284888753","https://openalex.org/W2291459177","https://openalex.org/W2983281977","https://openalex.org/W2333169060","https://openalex.org/W1947289352","https://openalex.org/W2055971697","https://openalex.org/W2591750438","https://openalex.org/W2986722180"],"abstract_inverted_index":{"In":[0,14],"recent":[1],"years,":[2],"convex":[3,25,47],"optimization":[4,48],"solved":[5],"very":[6],"large":[7],"practical":[8],"engineering":[9],"problems":[10],"reliably":[11],"and":[12,39,83],"eciently.":[13],"this":[15],"paper,":[16],"we":[17,57],"present":[18],"an":[19,22,69],"extension":[20],"of":[21,36,42],"algorithm":[23,95],"for":[24,32,46,93],"quadratic":[26],"programming":[27],"using":[28],"a":[29,34,60],"new":[30],"technique":[31],"nding":[33],"class":[35],"search":[37],"directions":[38],"the":[40,43,54,64,88,94],"strategy":[41],"central":[44],"path,":[45],"under":[49],"linear":[50],"constraints.":[51],"To":[52],"solve":[53],"initialization":[55],"problem,":[56],"have":[58],"introduced":[59],"weighted":[61],"vector":[62],"with":[63],"property":[65],"that":[66,77],"starting":[67],"from":[68],"initial":[70],"feasible":[71],"centred":[72],"point,":[73],"it":[74],"generates":[75],"iterates":[76],"simultaneously,":[78],"gets":[79],"closer":[80,84],"to":[81,85],"optimality":[82],"centrality.":[86],"Finally,":[87],"favorable":[89],"polynomial":[90],"complexity":[91],"bound":[92],"is":[96],"deserved":[97],"namely,":[98],"O":[99],"(":[100],"p":[101],"n":[102],"log(":[103],"x":[104],"t":[105],"z":[106],"))":[107],"iterations.":[108]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2136293333","counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
