On some interior-point algorithms for nonconvex quadratic optimization
- 87 Downloads
Recently, interior-point algorithms have been applied to nonlinear and nonconvex optimization. Most of these algorithms are either primal-dual path-following or affine-scaling in nature, and some of them are conjectured to converge to a local minimum. We give several examples to show that this may be untrue and we suggest some strategies for overcoming this difficulty.
KeywordsLocal Minimum Quadratic Optimization Nonconvex Optimization Nonconvex Quadratic Optimization
Unable to display preview. Download preview PDF.