{"cited_by_count":1493277,"description":"This cluster of papers covers advances in numerical optimization techniques, including topics such as benchmarking optimization software, semidefinite programming, global optimization, derivative-free optimization, and the application of sum of squares techniques. It also explores interior-point methods, quadratic programming, and mixed-integer nonlinear programs.","display_name":"Advanced Optimization Algorithms Research","domain_id":"3","external_ids":{"openalex":"https://openalex.org/T10963","wikipedia":"https://en.wikipedia.org/wiki/Mathematical_optimization"},"field_id":"26","id":"T10963","keywords":[{"display_name":"unconstrained optimization","id":"unconstrained-optimization","score":0.625,"url":"https://openalex.org/keywords/unconstrained-optimization"},{"display_name":"global convergence","id":"global-convergence","score":0.3237,"url":"https://openalex.org/keywords/global-convergence"},{"display_name":"interior point methods","id":"interior-point-methods","score":0.42,"url":"https://openalex.org/keywords/interior-point-methods"},{"display_name":"semidefinite programming","id":"semidefinite-programming","score":0.269,"url":"https://openalex.org/keywords/semidefinite-programming"},{"display_name":"large-scale optimization","id":"large-scale-optimization","score":0.2749,"url":"https://openalex.org/keywords/large-scale-optimization"},{"display_name":"trust region method","id":"trust-region-method","score":0.4603,"url":"https://openalex.org/keywords/trust-region-method"},{"display_name":"quasi-Newton methods","id":"quasi-newton-methods","score":0.2597,"url":"https://openalex.org/keywords/quasi-newton-methods"},{"display_name":"derivative-free optimization","id":"derivative-free-optimization","score":0.2078,"url":"https://openalex.org/keywords/derivative-free-optimization"},{"display_name":"superlinear convergence","id":"superlinear-convergence","score":0.4359,"url":"https://openalex.org/keywords/superlinear-convergence"},{"display_name":"semidefinite relaxation","id":"semidefinite-relaxation","score":0.2096,"url":"https://openalex.org/keywords/semidefinite-relaxation"},{"display_name":"polynomial optimization","id":"polynomial-optimization","score":0.5449,"url":"https://openalex.org/keywords/polynomial-optimization"},{"display_name":"linear complementarity problem","id":"linear-complementarity-problem","score":0.2787,"url":"https://openalex.org/keywords/linear-complementarity-problem"},{"display_name":"optimization software","id":"optimization-software","score":0.28,"url":"https://openalex.org/keywords/optimization-software"},{"display_name":"cutting planes","id":"cutting-planes","score":0.3183,"url":"https://openalex.org/keywords/cutting-planes"},{"display_name":"line search","id":"line-search","score":0.329,"url":"https://openalex.org/keywords/line-search"},{"display_name":"primal-dual interior point method","id":"primal-dual-interior-point-method","score":0.5101,"url":"https://openalex.org/keywords/primal-dual-interior-point-method"},{"display_name":"search direction","id":"search-direction","score":0.6127,"url":"https://openalex.org/keywords/search-direction"},{"display_name":"cutting plane method","id":"cutting-plane-method","score":0.2877,"url":"https://openalex.org/keywords/cutting-plane-method"},{"display_name":"equality constraints","id":"equality-constraints","score":0.216,"url":"https://openalex.org/keywords/equality-constraints"},{"display_name":"iteration complexity","id":"iteration-complexity","score":0.3743,"url":"https://openalex.org/keywords/iteration-complexity"},{"display_name":"function minimization","id":"function-minimization","score":0.3862,"url":"https://openalex.org/keywords/function-minimization"},{"display_name":"geometric programming","id":"geometric-programming","score":0.2707,"url":"https://openalex.org/keywords/geometric-programming"},{"display_name":"Hessian approximation","id":"hessian-approximation","score":0.3574,"url":"https://openalex.org/keywords/hessian-approximation"},{"display_name":"sufficient descent condition","id":"sufficient-descent-condition","score":0.796,"url":"https://openalex.org/keywords/sufficient-descent-condition"},{"display_name":"optimization theory","id":"optimization-theory","score":0.2859,"url":"https://openalex.org/keywords/optimization-theory"}],"legacy_keywords":["Optimization Software","Semidefinite Programming","Global Optimization","Nonlinear Programming","Interior-Point Methods","Derivative-Free Optimization","Quadratic Programming","Convex Optimization","Mixed-Integer Nonlinear Programs","Sum of Squares Techniques"],"openalex_id":"https://openalex.org/T10963","source_created_date":"2024-01-23T15:27:08","source_updated_date":"2026-10-17T03:02:00","subfield_id":"2612","url":"/topics/T10963","works_api_url":"https://api.openalex.org/works?filter=topics.id:T10963","works_count":74521,"label":"Advanced Optimization Algorithms Research","provider":"openalex","revision":"3e0bd74fa3b8d244","taxonomy_revision":"f050b5d4780b1289","title":"Advanced Optimization Algorithms Research","kind":"topic-directory","aeo_cohort":"topic-directory","catalogue_revision":"f050b5d4780b1289","numeric_address":"36240730172040377","address_version":"morton4x16-v1","coordinates":[3,26,2612,10963],"answer_status":"Directory metadata; local answer requires separate source review","truth_status":"Subject descriptor, not a factual answer or a demonstrated knowledge gap","reviewed_answer":null}