An interior-point method for solving box-constrained underdetermined nonlinear systems
type: Item
instance of: scholarly article
title: An interior-point method for solving box-constrained underdetermined nonlinear systems
zbMATH Open document ID: 1064.65035
author: Nataša Krejić
author: J. M. Martínez
author: J. B. Francisco
published in: Journal of Computational and Applied Mathematics
publication date: 2005-02-22T00:00:00Z
review text: Recently \textit{S. Bellavia, M. Macconi} and \textit{B. Morini} [Comput. Optim. Appl. 28, 31--50 (2004; Zbl 1056.90128)] developed an algorithm for solving \(n \times n\) nonlinear systems with box-constraints utilizing the interior trust-region approach of \textit{T. F. Coleman} and \textit{Y. Li} [SIAM J. Optim. 6, No. 2, 418--445 (1996; Zbl 0855.65063)]. Here the method is modified for and extended to the underdetermined case. Global and local convergence results are proved and some numerical experiments are presented.
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 2136617
zbMATH Keywords: underdetermined nonlinear systems
zbMATH Keywords: Newton method
zbMATH Keywords: global convergence
zbMATH Keywords: quadratic convergence
zbMATH Keywords: interior trust-region method
zbMATH Keywords: numerical experiments
zbMATH Keywords: algorithm
reviewed by: Werner C. Rheinboldt
describes a project that uses: STRSCNE
describes a project that uses: levmar
MaRDI profile type: Publication
full work available at URL: j.cam.2004.08.013
OpenAlex ID: W2145851435
cites work: Q5668259
cites work: An affine scaling trust-region approach to bound-constrained nonlinear systems
cites work: STRSCNE: a scaled trust-region solver for constrained nonlinear equations
cites work: On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
cites work: An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
cites work: Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
cites work: Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions
cites work: Test examples for nonlinear programming codes
cites work: Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
cites work: Q3718493
cites work: Quasi-Newton methods for solving underdetermined nonlinear simultaneous equations
cites work: Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
cites work: Inexact-restoration algorithm for constrained optimization
cites work: Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
cites work: Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problems
cites work: Q5491447
cites work: Properties of the sequential gradient-restoration algorithm (SGRA). I: Introduction and comparison with related methods
cites work: Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis
cites work: The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
cites work: The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
cites work: Q3908410
cites work: Least-Change Secant Update Methods for Underdetermined Systems
DOI: 10.1016/J.CAM.2004.08.013
description: scientific article; zbMATH DE number 2136617