A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations
From MaRDI portal
Publication:2019006
DOI10.1016/j.amc.2012.09.056zbMath1309.65055OpenAlexW1989047429MaRDI QIDQ2019006
R. P. Vignau, María Laura Schuverdt, Nélida E. Echebest
Publication date: 26 March 2015
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2012.09.056
global convergencebound constraintsquasi-Newton methodderivative-free line searchunderdetermined nonlinear systems
Derivative-free methods and methods using generalized derivatives (90C56) Numerical computation of solutions to systems of equations (65H10)
Related Items
Projected affine-scaling interior-point Newton's method with line search filter for box constrained optimization, An inexact Newton-like conditional gradient method for constrained nonlinear systems, An inexact projected LM type algorithm for solving convex constrained nonlinear equations, Optimization of black-box problems using Smolyak grids and polynomial approximations, On the global convergence of an inexact quasi-Newton conditional gradient method for constrained nonlinear systems, Approximate norm descent methods for constrained nonlinear systems, Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming, A Riemannian inexact Newton dogleg method for constructing a symmetric nonnegative matrix with prescribed spectrum, Projected adaptive cubic regularization algorithm with derivative-free filter technique for box constrained optimization, An inexact restoration derivative-free filter method for nonlinear programming, A Riemannian under-determined BFGS method for least squares inverse eigenvalue problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical experiments with an inexact Jacobian trust-region algorithm
- Two derivative-free methods for solving underdetermined nonlinear systems of equations
- An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
- Nonlinear programming without a penalty function or a filter
- A derivative-free method for the system of nonlinear equations
- Properties of the sequential gradient-restoration algorithm (SGRA). I: Introduction and comparison with related methods
- Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis
- Test examples for nonlinear programming codes
- An interior-point method for solving box-constrained underdetermined nonlinear systems
- Bounded-variable least-squares: an algorithm and applications
- Inexact-restoration algorithm for constrained optimization
- Some efficient derivative free methods with memory for solving nonlinear equations
- A globally and superlinearly convergent smoothing Broyden-like method for solving nonlinear complementarity problem
- A Derivative-Free Algorithm for Least-Squares Minimization
- Dynamic Control of Infeasibility in Equality Constrained Optimization
- The “global” convergence of Broyden-like methods with suitable line search
- Quasi-inexact-Newton methods with global convergence for solving constrained nonlinear systems
- On constrained optimization by adjoint based quasi-Newton methods
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- A Globally Convergent Filter Method for Nonlinear Programming
- Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions
- A Nonmonotone Line Search Technique for Newton’s Method
- Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
