On some interior-point algorithms for nonconvex quadratic optimization

DOI10.1007/s10107-002-0310-5zbMath1053.90136OpenAlexW1978235473MaRDI QIDQ1396211

Paul Tseng, Yinyu Ye

Publication date: 2002

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-002-0310-5

zbMATH Keywords

nonconvex optimizationquadratic optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Interior-point methods (90C51)

Related Items

Newton-KKT interior-point methods for indefinite quadratic programming, Optimization of algorithmic parameters using a meta-control approach, Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization, A logarithmic descent direction algorithm for the quadratic knapsack problem, Condition number based complexity estimate for computing local extrema

Uses Software

• GQTPAR