Answers are grounded in this paper and cite their sources.
It is known that strong uniqueness can be used to prove second order convergence of the generalised Gauss-Newton algorithm. Formally this algorithm includes sequential linear programming as a special case. Here we show that the second order convergence result extends when the sequential linear programming algorithm is formulated appropriately. Also this discussion provides an example which shows that the assumption of Lipschitz continuity is necessary for the second order convergence result based on strong uniqueness.
No takes yet. Share an insight, caveat, or question.
Osborne et al. (1990) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: