An inexact projected LM type algorithm for solving convex constrained nonlinear equations
From MaRDI portal
Publication:2656083
Recommendations
- A locally convergent inexact projected Levenberg-Marquardt-type algorithm for large-scale constrained nonsmooth equations
- On the Levenberg-Marquardt methods for convex constrained nonlinear equations
- A Smoothing Projected Levenberg-Marquardt Type Algorithm for Solving Constrained Equations
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- A Levenberg-Marquardt method with approximate projections
Cites work
- A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations
- A Levenberg-Marquardt method with approximate projections
- A method for the solution of certain non-linear problems in least squares
- A Newton conditional gradient method for constrained nonlinear systems
- A Nonmonotone Line Search Technique for Newton’s Method
- A projected derivative-free algorithm for nonlinear equations with convex constraints
- A projected gradient method for optimization over density matrices
- An affine scaling trust-region algorithm with interior backtracking technique for solving bound-constrained nonlinear systems
- An affine scaling trust-region approach to bound-constrained nonlinear systems
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- An inexact derivative-free Levenberg-Marquardt method for linear inequality constrained nonlinear systems under local error bound conditions
- An inexact Newton-like conditional gradient method for constrained nonlinear systems
- Approximate norm descent methods for constrained nonlinear systems
- CUTEr and SifDec
- scientific article; zbMATH DE number 1694914 (Why is no real title available?)
- Inexact Newton method via Lanczos decomposed technique for solving box-constrained nonlinear systems
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- On the constrained error bound condition and the projected Levenberg-Marquardt method
- On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds
- On the convergence properties of the Levenberg–Marquardt method
- On the Levenberg-Marquardt methods for convex constrained nonlinear equations
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- Quasi-inexact-Newton methods with global convergence for solving constrained nonlinear systems
- Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications
- Solving nonlinear systems of equations with simple constraints
- Subspace Trust‐Region Methods for Large Bound‐Constrained Nonlinear Equations
- Test example for nonlinear programming codes
- TRESNEI, a MATLAB trust-region solver for systems of nonlinear equalities and inequalities
- Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities
Cited in
(9)- A global Newton method for the nonsmooth vector fields on Riemannian manifolds
- Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares
- A Smoothing Projected Levenberg-Marquardt Type Algorithm for Solving Constrained Equations
- A NEW PROJECTION ALGORITHM FOR SOLVING A SYSTEM OF NONLINEAR EQUATIONS WITH CONVEX CONSTRAINTS
- A locally convergent inexact projected Levenberg-Marquardt-type algorithm for large-scale constrained nonsmooth equations
- A projected inexact Levenberg-Marquardt method for the completely positive matrix factorization
- A modified SGP method with two alternative spectral parameters for constrained nonlinear equations with a compressive sensing application
- Quasi-Newton interior point method for solving nonlinear system of equations with box constraints
- An improved HZ CG method with inexact projections for solving convex-constrained nonlinear equations and its applications
This page was built for publication: An inexact projected LM type algorithm for solving convex constrained nonlinear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656083)
