Numerical Functional Analysis and Optimization · 2008 · 16 citations · 36 references
ComputingComputer ScienceMathematicsAlgorithmsMachine LearningOptimizationApproximation AlgorithmsConstrained OptimizationIterative SolversNonlinear ProgrammingNumerical AlgorithmsOptimization TheoryLocal Convergence AnalysisNonlinear Convergence AnalysisNonlinear OptimizationNonlinear Solver ConvergenceSmooth OptimizationSmoothing
In this paper, we consider the least l 2-norm solution for a possibly inconsistent system of nonlinear inequalities. The objective function of the problem is only first-order continuously differentiable. By introducing a new smoothing function, the problem is approximated by a family of parameterized optimization problems with twice continuously differentiable objective functions. Then a Levenberg–Marquardt algorithm is proposed to solve the parameterized smooth optimization problems. It is proved that the algorithm either terminates finitely at a solution of the original inequality problem or generates an infinite sequence. In the latter case, the infinite sequence converges to a least l 2-norm solution of the inequality problem. The local quadratic convergence of the algorithm was produced under some conditions.
36
A nonsmooth version of Newton's method
Liqun Qi, Jie Sun · Mathematical Programming · 1993 · 1.5K citations