On some interior-point algorithms for nonconvex quadratic optimization
From MaRDI portal
The paper is concerned with the quadratic optimization problem \(\min f(x)=x^T Q x\) subject to \(x \geq 0\), where \(Q\) is a symmetric possibly indefinite matrix. The authors give several examples showing that in the case where \(\inf_{x \geq 0} f(x)=-\infty\), the central-path following method and the affine-scaling method may converge to the origin, which is not even a local minimum.
Recommendations
- On affine scaling algorithms for nonconvex quadratic programming
- Failure of global convergence for a class of interior point methods for nonlinear programming
- Interior-point algorithms for global optimization
- The trust region affine interior point algorithm for convex and nonconvex quadratic programming
- Newton-KKT interior-point methods for indefinite quadratic programming
Cited in
(8)- Condition number based complexity estimate for computing local extrema
- On some efficient interior point methods for nonlinear convex programming
- On affine scaling algorithms for nonconvex quadratic programming
- Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization
- A logarithmic descent direction algorithm for the quadratic knapsack problem
- Optimization of algorithmic parameters using a meta-control approach
- Interior-point algorithms for global optimization
- Newton-KKT interior-point methods for indefinite quadratic programming
This page was built for publication: On some interior-point algorithms for nonconvex quadratic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1396211)
