A projected derivative-free algorithm for nonlinear equations with convex constraints

DOI10.1080/10556788.2012.721129zbMath1285.65028OpenAlexW2006231473MaRDI QIDQ5746683

William La Cruz

Publication date: 7 February 2014

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2012.721129

zbMATH Keywords

numerical examplesnonlinear equationsconvex constraintsderivative-free algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Derivative-free methods and methods using generalized derivatives (90C56) Numerical computation of solutions to systems of equations (65H10)

Related Items (13)

Partially symmetrical derivative-free Liu–Storey projection method for convex constrained equations ⋮ An inexact Newton-like conditional gradient method for constrained nonlinear systems ⋮ Simulation of the oxygen distribution in a tumor tissue using residual algorithms ⋮ An inexact projected LM type algorithm for solving convex constrained nonlinear equations ⋮ On the global convergence of an inexact quasi-Newton conditional gradient method for constrained nonlinear systems ⋮ Secant-inexact projection algorithms for solving a new class of constrained mixed generalized equations problems ⋮ Approximate norm descent methods for constrained nonlinear systems ⋮ Newton's method with feasible inexact projections for solving constrained generalized equations ⋮ A diagonal PRP-type projection method for convex constrained nonlinear monotone equations ⋮ Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications ⋮ On the global convergence of a new spectral residual algorithm for nonlinear systems of equations ⋮ Solving nonlinear systems of equations via spectral residual methods: stepsize selection and applications ⋮ Derivative-free optimization methods

Cites Work

• Unnamed Item
• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• Active-set projected trust-region algorithm for box-constrained nonsmooth equations
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• A superlinearly convergent projection method for constrained systems of nonlinear equations
• On the convergence of a trust-region method for solving constrained nonlinear equations with degenerate solutions
• Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities
• An affine scaling trust-region approach to bound-constrained nonlinear systems
• STRSCNE: a scaled trust-region solver for constrained nonlinear equations
• Nonmonotone Trust-Region Methods for Bound-Constrained Semismooth Equations with Applications to Nonlinear Mixed Complementarity Problems
• A Globally Convergent Newton-GMRES Subspace Method for Systems of Nonlinear Equations
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Hybrid Krylov Methods for Nonlinear Systems of Equations
• Two-Point Step Size Gradient Methods
• Sparse matrix test problems
• A mathematical programming approach for determining oligopolistic market equilibrium
• Convergence Theory of Nonlinear Newton–Krylov Algorithms
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
• Algorithm 813
• Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
• An interior global method for nonlinear systems with simple bounds
• Strictly feasible equation-based methods for mixed complementarity problems

This page was built for publication: A projected derivative-free algorithm for nonlinear equations with convex constraints