SIAM Journal on Optimization · 2019 · 45 citations · 32 references
Natural SciencesComputer ScienceAlgorithmsMulti-criteria Decision MakingOptimizationMulti-objective OptimizationMultiobjective OptimizationNonlinear ProgrammingNumerical AlgorithmsOptimization TheoryPareto OptimalityConvergenceConvergence CriteriaGlobal Convergence AnalysisHessian ApproximationLipschitz ConditionsLipschitz ContinuityLipschitz OptimizationNewton Convergence
We consider the extended Newton method for approaching a Pareto optimum of a multiobjective optimization problem, establish quadratic convergence criteria, and estimate a radius of convergence ball under the assumption that the Hessians of objective functions satisfy an $L$-average Lipschitz condition. These convergence theorems significantly improve the corresponding ones in [J. Fliege, L. M. G. Drummond, and B. F. Svaiter, SIAM J. Optim., 20 (2009), pp. 602--626]. As applications of the obtained results, convergence theorems under the classical Lipschitz condition or the $\gamma$-condition are presented for multiobjective optimization, and the global quadratic convergence results of the extended Newton method with Armijo/Goldstein/Wolfe line-search schemes are also provided.
32
Historical Development of the Newton–Raphson Method
Tjalling Ypma · SIAM Review · 1995 · 908 citations
Logistic Regression, AdaBoost and Bregman Distances
Michael Collins, Robert E. Schapire, Yoram Singer · Machine Learning · 2002 · 689 citations · Full text