A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations
type: Item
instance of: scholarly article
title: A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations
zbMATH Open document ID: 1309.65055
author: R. P. Vignau
author: N. Echebest
author: María Laura Schuverdt
published in: Applied Mathematics and Computation
publication date: 2015-03-26T00:00:00Z
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 90C56
zbMATH DE Number: 6419874
zbMATH Keywords: underdetermined nonlinear systems
zbMATH Keywords: bound constraints
zbMATH Keywords: quasi-Newton method
zbMATH Keywords: derivative-free line search
zbMATH Keywords: global convergence
describes a project that uses: BOBYQA
MaRDI profile type: Publication
full work available at URL: j.amc.2012.09.056
OpenAlex ID: W1989047429
cites work: Q5668259
cites work: Dynamic Control of Infeasibility in Equality Constrained Optimization
cites work: Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points
cites work: Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions
cites work: Q3702408
cites work: An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
cites work: Two derivative-free methods for solving underdetermined nonlinear systems of equations
cites work: An interior-point method for solving box-constrained underdetermined nonlinear systems
cites work: Nonlinear programming without a penalty function or a filter
cites work: A Globally Convergent Filter Method for Nonlinear Programming
cites work: The “global” convergence of Broyden-like methods with suitable line search
cites work: On constrained optimization by adjoint based quasi-Newton methods
cites work: A Nonmonotone Line Search Technique for Newton’s Method
cites work: Test examples for nonlinear programming codes
cites work: Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
cites work: A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
cites work: A globally and superlinearly convergent smoothing Broyden-like method for solving nonlinear complementarity problem
cites work: Quasi-inexact-Newton methods with global convergence for solving constrained nonlinear systems
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: A derivative-free method for the system of nonlinear equations
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: Q3908410
cites work: Some efficient derivative free methods with memory for solving nonlinear equations
cites work: Bounded-variable least-squares: an algorithm and applications
cites work: Numerical experiments with an inexact Jacobian trust-region algorithm
cites work: A Derivative-Free Algorithm for Least-Squares Minimization
DOI: 10.1016/J.AMC.2012.09.056
description: scientific article; zbMATH DE number 6419874