The Convergence of a Levenberg–Marquardt Method for Nonlinear Inequalities
From MaRDI portal
Publication:3514746
DOI10.1080/01630560802099936zbMath1191.90075OpenAlexW1992444447MaRDI QIDQ3514746
Zheng-Hai Huang, Liqun Qi, Hong-Xia Yin
Publication date: 23 July 2008
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630560802099936
global convergencenonlinear inequalitiesLevenberg-Marquardt methodlocal quadratic convergenceinconsistentleast \(l_{2}\)-norm solution
Related Items (7)
A modified Levenberg-Marquardt method with line search for nonlinear equations ⋮ A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities ⋮ A regularized smoothing-type algorithm for solving a system of inequalities with a \(P_{0}\)-function ⋮ The Levenberg-Marquardt-type methods for a kind of vertical complementarity problem ⋮ An algorithm for a class of nonlinear complementarity problems with non-Lipschitzian functions ⋮ Solving system of inequalities via a smoothing homotopy method ⋮ A smoothing and regularization Broyden-like method for nonlinear inequalities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global convergence of a smooth approximation method for mathematical programs with complementarity constraints
- On the solution of nonlinear inequalities in a finite number of iterations
- Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
- Solving nonlinear inequalities in a finite number of iterations
- Factorized quasi-Newton methods for nonlinear least squares problems
- Newton's method for nonlinear inequalities
- Newton's method for linear inequality systems
- A semismooth equation approach to the solution of nonlinear complementarity problems
- Nonmonotone Levenberg-Marquardt algorithms and their convergence analysis
- Non-interior continuation methods for solving semidefinite complementarity problems
- Non-interior continuation method for solving the monotone semidefinite complementarity problem
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
- Connections between the total least squares and the correction of an infeasible system of linear inequalities
- A class of smoothing functions for nonlinear and mixed complementarity problems
- Predictor-corrector smoothing methods for linear programs with a more flexible update of the smoothing parameter
- Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
- A nonsmooth version of Newton's method
- The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems
- A Noninterior Continuation Method for Quadratic and Linear Programming
- Optimization and nonsmooth analysis
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- A smoothing-out technique for min—max optimization
- Semismooth and Semiconvex Functions in Constrained Optimization
- l1 solution of linear inequalities
- On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
- Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- A Family of Scaled Factorized Broyden-Like Methods for Nonlinear Least Squares Problems
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
- Solving Linear Inequalities in a Least Squares Sense
This page was built for publication: The Convergence of a Levenberg–Marquardt Method for Nonlinear Inequalities
