We propose some path-following algorithms for unconstrained or simply-constrained optimization problems.
We analyze their convergence rates under various Lipshitz conditions. We also explore the predictor and corrector method and its high-order extension.
|